Base | Representation |
---|---|
bin | 1001010001101111001010… |
… | …1000101011101000000011 |
3 | 1100010010211001111200212200 |
4 | 2110123302220223220003 |
5 | 2314110230204031202 |
6 | 33405544100324243 |
7 | 2101643341606161 |
oct | 224336250535003 |
9 | 40103731450780 |
10 | 10200323111427 |
11 | 3282a29524659 |
12 | 1188a836a3683 |
13 | 58cb6a3a7b97 |
14 | 2739ac0bc231 |
15 | 12a50193de1c |
hex | 946f2a2ba03 |
10200323111427 has 24 divisors (see below), whose sum is σ = 14752424429184. Its totient is φ = 6791621468544.
The previous prime is 10200323111383. The next prime is 10200323111431. The reversal of 10200323111427 is 72411132300201.
10200323111427 is a `hidden beast` number, since 1 + 0 + 2 + 0 + 0 + 3 + 231 + 1 + 1 + 427 = 666.
It is not a de Polignac number, because 10200323111427 - 228 = 10200054675971 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10200323111427.
It is not an unprimeable number, because it can be changed into a prime (10200323111497) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67354263 + ... + 67505535.
It is an arithmetic number, because the mean of its divisors is an integer number (614684351216).
Almost surely, 210200323111427 is an apocalyptic number.
10200323111427 is a deficient number, since it is larger than the sum of its proper divisors (4552101317757).
10200323111427 is a wasteful number, since it uses less digits than its factorization.
10200323111427 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160699 (or 160696 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
Adding to 10200323111427 its reverse (72411132300201), we get a palindrome (82611455411628).
The spelling of 10200323111427 in words is "ten trillion, two hundred billion, three hundred twenty-three million, one hundred eleven thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •