Base | Representation |
---|---|
bin | 1001010001101111001010… |
… | …0000101011010100100111 |
3 | 1100010010210220120002102022 |
4 | 2110123302200223110213 |
5 | 2314110224134404111 |
6 | 33405543543333355 |
7 | 2101643315016332 |
oct | 224336240532447 |
9 | 40103726502368 |
10 | 10200321013031 |
11 | 3282a28321046 |
12 | 1188a82a5125b |
13 | 58cb69b21a26 |
14 | 2739abad3619 |
15 | 12a5016772db |
hex | 946f282b527 |
10200321013031 has 8 divisors (see below), whose sum is σ = 10528873529328. Its totient is φ = 9875566792000.
The previous prime is 10200321013027. The next prime is 10200321013079. The reversal of 10200321013031 is 13031012300201.
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 10200321013031 - 22 = 10200321013027 is a prime.
It is a super-2 number, since 2×102003210130312 (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 (10200321073031) 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, 949568360 + ... + 949579101.
It is an arithmetic number, because the mean of its divisors is an integer number (1316109191166).
Almost surely, 210200321013031 is an apocalyptic number.
10200321013031 is a deficient number, since it is larger than the sum of its proper divisors (328552516297).
10200321013031 is a wasteful number, since it uses less digits than its factorization.
10200321013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1899147633.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10200321013031 its reverse (13031012300201), we get a palindrome (23231333313232).
The spelling of 10200321013031 in words is "ten trillion, two hundred billion, three hundred twenty-one million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •