Base | Representation |
---|---|
bin | 1011111110010101… |
… | …1000110001000010 |
3 | 22022000011202202020 |
4 | 2333211120301002 |
5 | 23040321432101 |
6 | 1250540302310 |
7 | 142436444262 |
oct | 27745306102 |
9 | 8260152666 |
10 | 3214249026 |
11 | 13aa3a595a |
12 | 758541996 |
13 | 3c2bba401 |
14 | 226c577a2 |
15 | 13c2b5136 |
hex | bf958c42 |
3214249026 has 8 divisors (see below), whose sum is σ = 6428498064. Its totient is φ = 1071416340.
The previous prime is 3214249021. The next prime is 3214249033. The reversal of 3214249026 is 6209424123.
3214249026 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
3214249026 is an admirable number.
It is a super-2 number, since 2×32142490262 = 20662793602283897352, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3214249021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 267854080 + ... + 267854091.
It is an arithmetic number, because the mean of its divisors is an integer number (803562258).
Almost surely, 23214249026 is an apocalyptic number.
3214249026 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3214249026 is a wasteful number, since it uses less digits than its factorization.
3214249026 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535708176.
The product of its (nonzero) digits is 20736, while the sum is 33.
The square root of 3214249026 is about 56694.3473901940. The cubic root of 3214249026 is about 1475.7966051868.
The spelling of 3214249026 in words is "three billion, two hundred fourteen million, two hundred forty-nine thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •