Base | Representation |
---|---|
bin | 1001010001101110000101… |
… | …0101111111101100001001 |
3 | 1100010010001211121112002110 |
4 | 2110123201111333230021 |
5 | 2314104131422001301 |
6 | 33405455214252533 |
7 | 2101633216653642 |
oct | 224334125775411 |
9 | 40103054545073 |
10 | 10200033000201 |
11 | 328289a794810 |
12 | 1188a024b7149 |
13 | 58cb22260135 |
14 | 2739817606c9 |
15 | 12a4d62350d6 |
hex | 946e157fb09 |
10200033000201 has 128 divisors (see below), whose sum is σ = 16072849128960. Its totient is φ = 5693751705600.
The previous prime is 10200033000193. The next prime is 10200033000211.
It is a happy number.
10200033000201 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10200033000201 - 23 = 10200033000193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10200033000211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 684696385 + ... + 684711281.
It is an arithmetic number, because the mean of its divisors is an integer number (125569133820).
Almost surely, 210200033000201 is an apocalyptic number.
10200033000201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10200033000201 is a deficient number, since it is larger than the sum of its proper divisors (5872816128759).
10200033000201 is a wasteful number, since it uses less digits than its factorization.
10200033000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15355.
The product of its (nonzero) digits is 36, while the sum is 12.
It can be divided in two parts, 1020003 and 3000201, that added together give a palindrome (4020204).
The spelling of 10200033000201 in words is "ten trillion, two hundred billion, thirty-three million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •