Base | Representation |
---|---|
bin | 10001011011010… |
… | …11011110011001 |
3 | 101012002100002221 |
4 | 20231223132121 |
5 | 244411123111 |
6 | 22301224041 |
7 | 3423420364 |
oct | 1055533631 |
9 | 335070087 |
10 | 146192281 |
11 | 75581474 |
12 | 40b62021 |
13 | 24397a11 |
14 | 155b70db |
15 | cc7b371 |
hex | 8b6b799 |
146192281 has 9 divisors (see below), whose sum is σ = 148888831. Its totient is φ = 143544352.
The previous prime is 146192279. The next prime is 146192297. The reversal of 146192281 is 182291641.
It is a happy number.
The square root of 146192281 is 12091.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2576025 + 143616256 = 1605^2 + 11984^2 .
It is not a de Polignac number, because 146192281 - 21 = 146192279 is a prime.
It is a super-2 number, since 2×1461922812 = 42744366047965922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146192681) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1293681 + ... + 1293793.
Almost surely, 2146192281 is an apocalyptic number.
146192281 is the 12091-st square number.
146192281 is the 6046-th centered octagonal number.
It is an amenable number.
146192281 is a deficient number, since it is larger than the sum of its proper divisors (2696550).
146192281 is an frugal number, since it uses more digits than its factorization.
146192281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440 (or 220 counting only the distinct ones).
The product of its digits is 6912, while the sum is 34.
The cubic root of 146192281 is about 526.7948016934.
It can be divided in two parts, 14619 and 2281, that added together give a square (16900 = 1302).
The spelling of 146192281 in words is "one hundred forty-six million, one hundred ninety-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •