Base | Representation |
---|---|
bin | 1001101001111000010000… |
… | …01011101011011101100111 |
3 | 2210011120202101201000222110 |
4 | 10310330020023223131213 |
5 | 10240313332104422323 |
6 | 113053000125332103 |
7 | 4320554112550521 |
oct | 464741013533547 |
9 | 83146671630873 |
10 | 21230160623463 |
11 | 684572a225a20 |
12 | 246a669a07033 |
13 | baccc3311cac |
14 | 53578c282a11 |
15 | 26c3a2827793 |
hex | 134f082eb767 |
21230160623463 has 8 divisors (see below), whose sum is σ = 30880233634176. Its totient is φ = 12866764014200.
The previous prime is 21230160623437. The next prime is 21230160623473. The reversal of 21230160623463 is 36432606103212.
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 21230160623463 - 213 = 21230160615271 is a prime.
It is a super-2 number, since 2×212301606234632 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21230160623473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 321669100323 + ... + 321669100388.
It is an arithmetic number, because the mean of its divisors is an integer number (3860029204272).
Almost surely, 221230160623463 is an apocalyptic number.
21230160623463 is a deficient number, since it is larger than the sum of its proper divisors (9650073010713).
21230160623463 is a wasteful number, since it uses less digits than its factorization.
21230160623463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 643338200725.
The product of its (nonzero) digits is 186624, while the sum is 39.
Adding to 21230160623463 its reverse (36432606103212), we get a palindrome (57662766726675).
The spelling of 21230160623463 in words is "twenty-one trillion, two hundred thirty billion, one hundred sixty million, six hundred twenty-three thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •