Base | Representation |
---|---|
bin | 1001000111010000111010… |
… | …0100000011010010001111 |
3 | 1022110221102010010201201211 |
4 | 2101310032210003102033 |
5 | 2303133241134030411 |
6 | 33151150512515251 |
7 | 2052643633305223 |
oct | 221641644032217 |
9 | 38427363121654 |
10 | 10020403033231 |
11 | 32136a130a958 |
12 | 115a03084bb27 |
13 | 578bc6197256 |
14 | 268dc0b68783 |
15 | 1259c1271221 |
hex | 91d0e90348f |
10020403033231 has 16 divisors (see below), whose sum is σ = 11072012857344. Its totient is φ = 9020210880384.
The previous prime is 10020403033219. The next prime is 10020403033241. The reversal of 10020403033231 is 13233030402001.
It is a cyclic number.
It is not a de Polignac number, because 10020403033231 - 27 = 10020403033103 is a prime.
It is a super-2 number, since 2×100204030332312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020403033241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3958150 + ... + 5975596.
It is an arithmetic number, because the mean of its divisors is an integer number (692000803584).
Almost surely, 210020403033231 is an apocalyptic number.
10020403033231 is a deficient number, since it is larger than the sum of its proper divisors (1051609824113).
10020403033231 is a wasteful number, since it uses less digits than its factorization.
10020403033231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2030190.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 10020403033231 its reverse (13233030402001), we get a palindrome (23253433435232).
The spelling of 10020403033231 in words is "ten trillion, twenty billion, four hundred three million, thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •