Base | Representation |
---|---|
bin | 1010000000010110101100… |
… | …1110001010101111110010 |
3 | 1102221201001020201012112012 |
4 | 2200011223032022233302 |
5 | 2420220434242334302 |
6 | 35221515224402522 |
7 | 2213545146064430 |
oct | 240055316125762 |
9 | 42851036635465 |
10 | 11001210121202 |
11 | 3561650348984 |
12 | 1298137016442 |
13 | 61a5430502c2 |
14 | 2a066617bd50 |
15 | 141277a43a52 |
hex | a016b38abf2 |
11001210121202 has 8 divisors (see below), whose sum is σ = 18859217350656. Its totient is φ = 4714804337652.
The previous prime is 11001210121199. The next prime is 11001210121241. The reversal of 11001210121202 is 20212101210011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×110012101212023 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 785800722943 = 11001210121202 / (1 + 1 + 0 + 0 + 1 + 2 + 1 + 0 + 1 + 2 + 1 + 2 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 392900361458 + ... + 392900361485.
It is an arithmetic number, because the mean of its divisors is an integer number (2357402168832).
Almost surely, 211001210121202 is an apocalyptic number.
11001210121202 is a deficient number, since it is larger than the sum of its proper divisors (7858007229454).
11001210121202 is an equidigital number, since it uses as much as digits as its factorization.
11001210121202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785800722952.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11001210121202 its reverse (20212101210011), we get a palindrome (31213311331213).
The spelling of 11001210121202 in words is "eleven trillion, one billion, two hundred ten million, one hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •