Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1001100001000001001011 |
3 | 1100010010020120121220012010 |
4 | 2110123211121201001023 |
5 | 2314104301331011021 |
6 | 33405510044351003 |
7 | 2101635004142262 |
oct | 224334531410113 |
9 | 40103216556163 |
10 | 10200101032011 |
11 | 3282925131050 |
12 | 1188a21245463 |
13 | 58cb3338cb47 |
14 | 27398a7cd5d9 |
15 | 12a4dc1c2976 |
hex | 946e566104b |
10200101032011 has 16 divisors (see below), whose sum is σ = 15152181032448. Its totient is φ = 6050350063200.
The previous prime is 10200101031961. The next prime is 10200101032031. The reversal of 10200101032011 is 11023010100201.
It is not a de Polignac number, because 10200101032011 - 29 = 10200101031499 is a prime.
It is a super-2 number, since 2×102001010320112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10200101032031) 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 15 ways as a sum of consecutive naturals, for example, 3288232180 + ... + 3288235281.
It is an arithmetic number, because the mean of its divisors is an integer number (947011314528).
Almost surely, 210200101032011 is an apocalyptic number.
10200101032011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10200101032011 is a deficient number, since it is larger than the sum of its proper divisors (4952080000437).
10200101032011 is a wasteful number, since it uses less digits than its factorization.
10200101032011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6576467522.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10200101032011 its reverse (11023010100201), we get a palindrome (21223111132212).
The spelling of 10200101032011 in words is "ten trillion, two hundred billion, one hundred one million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •