Base | Representation |
---|---|
bin | 10011000000000100… |
… | …11111110101010000 |
3 | 222022221100202101022 |
4 | 21200002133311100 |
5 | 131343001431000 |
6 | 4404131055012 |
7 | 510536533463 |
oct | 114002376520 |
9 | 28287322338 |
10 | 10201202000 |
11 | 4365349060 |
12 | 1b88441468 |
13 | c675a5902 |
14 | 6cab792da |
15 | 3ea8a3585 |
hex | 26009fd50 |
10201202000 has 160 divisors (see below), whose sum is σ = 27181260288. Its totient is φ = 3672000000.
The previous prime is 10201201993. The next prime is 10201202027. The reversal of 10201202000 is 20210201.
Added to its reverse (20210201) it gives a square (10221412201 = 1011012).
It is a Cunningham number, because it is equal to 1010012-1.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
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, 2219705 + ... + 2224295.
Almost surely, 210201202000 is an apocalyptic number.
10201202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10201202000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13590630144).
10201202000 is an abundant number, since it is smaller than the sum of its proper divisors (16980058288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201202000 is a wasteful number, since it uses less digits than its factorization.
10201202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4726 (or 4710 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 10201202000 its reverse (20210201), we get a palindrome (10221412201).
The spelling of 10201202000 in words is "ten billion, two hundred one million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •