Base | Representation |
---|---|
bin | 1001000111110101011010… |
… | …0001010001111110001101 |
3 | 1022111212200220020102111002 |
4 | 2101331112201101332031 |
5 | 2303313322222413401 |
6 | 33155451012110045 |
7 | 2053441465665653 |
oct | 221752641217615 |
9 | 38455626212432 |
10 | 10030200201101 |
11 | 3217869588103 |
12 | 115bb05905325 |
13 | 579ac7b482c2 |
14 | 26966ddacdd3 |
15 | 125d96415a6b |
hex | 91f56851f8d |
10030200201101 has 32 divisors (see below), whose sum is σ = 10297935648000. Its totient is φ = 9766279720960.
The previous prime is 10030200201083. The next prime is 10030200201167. The reversal of 10030200201101 is 10110200203001.
It is a cyclic number.
It is not a de Polignac number, because 10030200201101 - 26 = 10030200201037 is a prime.
It is a super-2 number, since 2×100302002011012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030200201181) 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 31 ways as a sum of consecutive naturals, for example, 2625017771 + ... + 2625021591.
It is an arithmetic number, because the mean of its divisors is an integer number (321810489000).
Almost surely, 210030200201101 is an apocalyptic number.
It is an amenable number.
10030200201101 is a deficient number, since it is larger than the sum of its proper divisors (267735446899).
10030200201101 is a wasteful number, since it uses less digits than its factorization.
10030200201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5029.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10030200201101 its reverse (10110200203001), we get a palindrome (20140400404102).
The spelling of 10030200201101 in words is "ten trillion, thirty billion, two hundred million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •