Base | Representation |
---|---|
bin | 1001000111110101000010… |
… | …0111101111100111101110 |
3 | 1022111212110000000021112220 |
4 | 2101331100213233213232 |
5 | 2303313121403411420 |
6 | 33155433114540210 |
7 | 2053436154526431 |
oct | 221752047574756 |
9 | 38455400007486 |
10 | 10030101232110 |
11 | 3217818730253 |
12 | 115ba98737666 |
13 | 579ab04a5b7b |
14 | 269660ba9818 |
15 | 125d8c8b6840 |
hex | 91f509ef9ee |
10030101232110 has 64 divisors (see below), whose sum is σ = 25508665800000. Its totient is φ = 2515343081472.
The previous prime is 10030101232103. The next prime is 10030101232133. The reversal of 10030101232110 is 1123210103001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10030101232110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7236055 + ... + 8510034.
It is an arithmetic number, because the mean of its divisors is an integer number (398572903125).
Almost surely, 210030101232110 is an apocalyptic number.
10030101232110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10030101232110 is an abundant number, since it is smaller than the sum of its proper divisors (15478564567890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10030101232110 is a wasteful number, since it uses less digits than its factorization.
10030101232110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15747365.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10030101232110 its reverse (1123210103001), we get a palindrome (11153311335111).
The spelling of 10030101232110 in words is "ten trillion, thirty billion, one hundred one million, two hundred thirty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •