Base | Representation |
---|---|
bin | 1001110000110001111001… |
… | …01001010101011100111001 |
3 | 2211000020202112120020222110 |
4 | 10320120330221111130321 |
5 | 10303204424041423022 |
6 | 113353531442042533 |
7 | 4343646546246264 |
oct | 470307451253471 |
9 | 84006675506873 |
10 | 21467264014137 |
11 | 6927240981757 |
12 | 24a85bb349449 |
13 | bc947b55c0b6 |
14 | 543041d5dcdb |
15 | 27362d31400c |
hex | 13863ca55739 |
21467264014137 has 8 divisors (see below), whose sum is σ = 29108154595680. Its totient is φ = 14068941387680.
The previous prime is 21467264014127. The next prime is 21467264014177. The reversal of 21467264014137 is 73141046276412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21467264014137 - 215 = 21467263981369 is a prime.
It is a super-2 number, since 2×214672640141372 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21467264014127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60641988564 + ... + 60641988917.
It is an arithmetic number, because the mean of its divisors is an integer number (3638519324460).
Almost surely, 221467264014137 is an apocalyptic number.
It is an amenable number.
21467264014137 is a deficient number, since it is larger than the sum of its proper divisors (7640890581543).
21467264014137 is a wasteful number, since it uses less digits than its factorization.
21467264014137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121283977543.
The product of its (nonzero) digits is 1354752, while the sum is 48.
The spelling of 21467264014137 in words is "twenty-one trillion, four hundred sixty-seven billion, two hundred sixty-four million, fourteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •