Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1011100110101011010100 |
3 | 1022202112212101110212022210 |
4 | 2102332112323212223110 |
5 | 2310434300040221322 |
6 | 33251513122553420 |
7 | 2061462265135335 |
oct | 222762673465324 |
9 | 38675771425283 |
10 | 10100000320212 |
11 | 3244427968760 |
12 | 1171545808870 |
13 | 58356ca4a92a |
14 | 26cbb223428c |
15 | 127ace1e270c |
hex | 92f96ee6ad4 |
10100000320212 has 48 divisors (see below), whose sum is σ = 26092809533952. Its totient is φ = 3014925466080.
The previous prime is 10100000320139. The next prime is 10100000320213. The reversal of 10100000320212 is 21202300000101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100000320213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 570999768 + ... + 571017455.
It is an arithmetic number, because the mean of its divisors is an integer number (543600198624).
Almost surely, 210100000320212 is an apocalyptic number.
10100000320212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10100000320212 is an abundant number, since it is smaller than the sum of its proper divisors (15992809213740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100000320212 is a wasteful number, since it uses less digits than its factorization.
10100000320212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1142017308 (or 1142017306 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10100000320212 its reverse (21202300000101), we get a palindrome (31302300320313).
The spelling of 10100000320212 in words is "ten trillion, one hundred billion, three hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •