Base | Representation |
---|---|
bin | 1001010001101101111111… |
… | …1111000001011110110011 |
3 | 1100010010000020201012111000 |
4 | 2110123133333001132303 |
5 | 2314104110102413021 |
6 | 33405453041453043 |
7 | 2101632522116001 |
oct | 224333777013663 |
9 | 40103006635430 |
10 | 10200010201011 |
11 | 3282888932404 |
12 | 11889b6941183 |
13 | 58cb1a6098a7 |
14 | 27397c707a71 |
15 | 12a4d422eb26 |
hex | 946dffc17b3 |
10200010201011 has 8 divisors (see below), whose sum is σ = 15111126223760. Its totient is φ = 6800006800656.
The previous prime is 10200010200967. The next prime is 10200010201013. The reversal of 10200010201011 is 11010201000201.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-10200010201011 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 junction number, because it is equal to n+sod(n) for n = 10200010200984 and 10200010201002.
It is not an unprimeable number, because it can be changed into a prime (10200010201013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 188889077770 + ... + 188889077823.
It is an arithmetic number, because the mean of its divisors is an integer number (1888890777970).
Almost surely, 210200010201011 is an apocalyptic number.
10200010201011 is a deficient number, since it is larger than the sum of its proper divisors (4911116022749).
10200010201011 is an equidigital number, since it uses as much as digits as its factorization.
10200010201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377778155602 (or 377778155596 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10200010201011 its reverse (11010201000201), we get a palindrome (21210211201212).
The spelling of 10200010201011 in words is "ten trillion, two hundred billion, ten million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •