Base | Representation |
---|---|
bin | 101111000010000110… |
… | …0000011111100100010 |
3 | 100122201000002022212200 |
4 | 1132010030003330202 |
5 | 3123323003032320 |
6 | 114222155234030 |
7 | 10203631565514 |
oct | 1360414037442 |
9 | 318630068780 |
10 | 101002002210 |
11 | 3991aaa71aa |
12 | 176a9448916 |
13 | 96a829b065 |
14 | 4c6216dbb4 |
15 | 29621b4290 |
hex | 1784303f22 |
101002002210 has 24 divisors (see below), whose sum is σ = 262605205980. Its totient is φ = 26933867232.
The previous prime is 101002002209. The next prime is 101002002217. The reversal of 101002002210 is 12200200101.
It can be written as a sum of positive squares in 2 ways, for example, as 95776013529 + 5225988681 = 309477^2 + 72291^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101002002192 and 101002002201.
It is not an unprimeable number, because it can be changed into a prime (101002002217) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 561122145 + ... + 561122324.
Almost surely, 2101002002210 is an apocalyptic number.
101002002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101002002210 is an abundant number, since it is smaller than the sum of its proper divisors (161603203770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002002210 is a wasteful number, since it uses less digits than its factorization.
101002002210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1122244482 (or 1122244479 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 101002002210 its reverse (12200200101), we get a palindrome (113202202311).
The spelling of 101002002210 in words is "one hundred one billion, two million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •