Base | Representation |
---|---|
bin | 1001010001110001101100… |
… | …0110110110110100001100 |
3 | 1100010012120101011102010010 |
4 | 2110130123012312310030 |
5 | 2314113123020011340 |
6 | 33410135313513220 |
7 | 2101666225161405 |
oct | 224343306666414 |
9 | 40105511142103 |
10 | 10201002110220 |
11 | 328324782a489 |
12 | 1189032b72810 |
13 | 58cc47c7320c |
14 | 273a3434a9ac |
15 | 12a541363b80 |
hex | 9471b1b6d0c |
10201002110220 has 48 divisors (see below), whose sum is σ = 30242970965088. Its totient is φ = 2560251509760.
The previous prime is 10201002110191. The next prime is 10201002110297. The reversal of 10201002110220 is 2201120010201.
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 = 10201002110196 and 10201002110205.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5000490211 + ... + 5000492250.
It is an arithmetic number, because the mean of its divisors is an integer number (630061895106).
Almost surely, 210201002110220 is an apocalyptic number.
10201002110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201002110220 is an abundant number, since it is smaller than the sum of its proper divisors (20041968854868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201002110220 is a wasteful number, since it uses less digits than its factorization.
10201002110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000982490 (or 10000982488 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10201002110220 its reverse (2201120010201), we get a palindrome (12402122120421).
The spelling of 10201002110220 in words is "ten trillion, two hundred one billion, two million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •