Base | Representation |
---|---|
bin | 1001000111001111011111… |
… | …0111101110000011110000 |
3 | 1022110220102120202011000221 |
4 | 2101303313313232003300 |
5 | 2303132001203010300 |
6 | 33151045032422424 |
7 | 2052631331243254 |
oct | 221636767560360 |
9 | 38426376664027 |
10 | 10020022313200 |
11 | 32135164132a9 |
12 | 1159b45247a14 |
13 | 578b65346423 |
14 | 268d86382264 |
15 | 12599cb1a31a |
hex | 91cf7dee0f0 |
10020022313200 has 120 divisors (see below), whose sum is σ = 25203251732400. Its totient is φ = 3823177236480.
The previous prime is 10020022313159. The next prime is 10020022313201. The reversal of 10020022313200 is 231322002001.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020022313201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4240785 + ... + 6166384.
It is an arithmetic number, because the mean of its divisors is an integer number (210027097770).
Almost surely, 210020022313200 is an apocalyptic number.
10020022313200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10020022313200 is an abundant number, since it is smaller than the sum of its proper divisors (15183229419200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10020022313200 is a wasteful number, since it uses less digits than its factorization.
10020022313200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10407299 (or 10407288 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 10020022313200 its reverse (231322002001), we get a palindrome (10251344315201).
The spelling of 10020022313200 in words is "ten trillion, twenty billion, twenty-two million, three hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •