Base | Representation |
---|---|
bin | 1001000110000100111110… |
… | …1001110000111000110100 |
3 | 1022101222210121021012021010 |
4 | 2101201033221300320310 |
5 | 2302320020133311200 |
6 | 33133540150152220 |
7 | 2051322552222225 |
oct | 221411751607064 |
9 | 38358717235233 |
10 | 10000020213300 |
11 | 3205a9178a627 |
12 | 11560a2652670 |
13 | 576cc83b4a60 |
14 | 268009ab124c |
15 | 1251cbad7150 |
hex | 9184fa70e34 |
10000020213300 has 144 divisors (see below), whose sum is σ = 31434782420160. Its totient is φ = 2439759759360.
The previous prime is 10000020213277. The next prime is 10000020213301. The reversal of 10000020213300 is 331202000001.
It is a happy number.
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 (10000020213301) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10904910 + ... + 11786309.
It is an arithmetic number, because the mean of its divisors is an integer number (218297100140).
Almost surely, 210000020213300 is an apocalyptic number.
10000020213300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000020213300 is an abundant number, since it is smaller than the sum of its proper divisors (21434762206860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000020213300 is a wasteful number, since it uses less digits than its factorization.
10000020213300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22691362 (or 22691355 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10000020213300 its reverse (331202000001), we get a palindrome (10331222213301).
The spelling of 10000020213300 in words is "ten trillion, twenty million, two hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •