Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …101000001110000111011010 |
3 | 111021022122102201002001120201 |
4 | 113000222002220032013122 |
5 | 101231031013004310020 |
6 | 555122422442012414 |
7 | 30213321366326650 |
oct | 2700520250160732 |
9 | 437278381061521 |
10 | 101200211010010 |
11 | 2a27784a916202 |
12 | b425341aa710a |
13 | 44611a6371438 |
14 | 1adc18b386dd0 |
15 | ba76b2c8ba0a |
hex | 5c0a82a0e1da |
101200211010010 has 64 divisors (see below), whose sum is σ = 208793407083264. Its totient is φ = 34595548416000.
The previous prime is 101200211010007. The next prime is 101200211010061. The reversal of 101200211010010 is 10010112002101.
101200211010010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 260026560 + ... + 260415460.
It is an arithmetic number, because the mean of its divisors is an integer number (3262396985676).
Almost surely, 2101200211010010 is an apocalyptic number.
101200211010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101200211010010 is an abundant number, since it is smaller than the sum of its proper divisors (107593196073254).
101200211010010 is a wasteful number, since it uses less digits than its factorization.
101200211010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399799.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101200211010010 its reverse (10010112002101), we get a palindrome (111210323012111).
The spelling of 101200211010010 in words is "one hundred one trillion, two hundred billion, two hundred eleven million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •