Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1001000001010000001000 |
3 | 1100010010001000102112010210 |
4 | 2110123200221001100020 |
5 | 2314104120412210440 |
6 | 33405454113441120 |
7 | 2101633014520350 |
oct | 224334051012010 |
9 | 40103030375123 |
10 | 10200021210120 |
11 | 3282894071745 |
12 | 11889ba5701a0 |
13 | 58cb1c992861 |
14 | 27397dd71b60 |
15 | 12a4d51a6a80 |
hex | 946e0a41408 |
10200021210120 has 128 divisors (see below), whose sum is σ = 35186050851840. Its totient is φ = 2317130115840.
The previous prime is 10200021210079. The next prime is 10200021210139. The reversal of 10200021210120 is 2101212000201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10200021210096 and 10200021210105.
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, 37111186 + ... + 37385025.
It is an arithmetic number, because the mean of its divisors is an integer number (274891022280).
Almost surely, 210200021210120 is an apocalyptic number.
10200021210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10200021210120 is an abundant number, since it is smaller than the sum of its proper divisors (24986029641720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200021210120 is a wasteful number, since it uses less digits than its factorization.
10200021210120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74496395 (or 74496391 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10200021210120 its reverse (2101212000201), we get a palindrome (12301233210321).
The spelling of 10200021210120 in words is "ten trillion, two hundred billion, twenty-one million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •