Base | Representation |
---|---|
bin | 10010111111111100… |
… | …10011010010000101 |
3 | 222022212021212111100 |
4 | 21133332103102011 |
5 | 131342211231041 |
6 | 4404051330313 |
7 | 510524302524 |
oct | 113776232205 |
9 | 28285255440 |
10 | 10200102021 |
11 | 436476768a |
12 | 1b87bb0999 |
13 | c672ac035 |
14 | 6ca9704bb |
15 | 3ea7376b6 |
hex | 25ff93485 |
10200102021 has 24 divisors (see below), whose sum is σ = 15186447224. Its totient is φ = 6592337280.
The previous prime is 10200102013. The next prime is 10200102037. The reversal of 10200102021 is 12020100201.
It can be written as a sum of positive squares in 4 ways, for example, as 4340964996 + 5859137025 = 65886^2 + 76545^2 .
It is not a de Polignac number, because 10200102021 - 23 = 10200102013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10200101994 and 10200102012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200103021) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 36951 + ... + 147531.
Almost surely, 210200102021 is an apocalyptic number.
It is an amenable number.
10200102021 is a deficient number, since it is larger than the sum of its proper divisors (4986345203).
10200102021 is a wasteful number, since it uses less digits than its factorization.
10200102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110901 (or 110898 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10200102021 its reverse (12020100201), we get a palindrome (22220202222).
The spelling of 10200102021 in words is "ten billion, two hundred million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •