Base | Representation |
---|---|
bin | 1010000111110110111001… |
… | …0000111111011110100111 |
3 | 1110102000202111222021101102 |
4 | 2201331232100333132213 |
5 | 2424323431203241012 |
6 | 35401034012550315 |
7 | 2226060335554433 |
oct | 241755620773647 |
9 | 43360674867342 |
10 | 11130110212007 |
11 | 3601287064a46 |
12 | 12b910b48239b |
13 | 6297460a6597 |
14 | 2a69b352d9c3 |
15 | 1447be03d2c2 |
hex | a1f6e43f7a7 |
11130110212007 has 2 divisors, whose sum is σ = 11130110212008. Its totient is φ = 11130110212006.
The previous prime is 11130110211901. The next prime is 11130110212019. The reversal of 11130110212007 is 70021201103111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11130110212007 - 214 = 11130110195623 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11130110212007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11130110212807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565055106003 + 5565055106004.
It is an arithmetic number, because the mean of its divisors is an integer number (5565055106004).
Almost surely, 211130110212007 is an apocalyptic number.
11130110212007 is a deficient number, since it is larger than the sum of its proper divisors (1).
11130110212007 is an equidigital number, since it uses as much as digits as its factorization.
11130110212007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 11130110212007 its reverse (70021201103111), we get a palindrome (81151311315118).
The spelling of 11130110212007 in words is "eleven trillion, one hundred thirty billion, one hundred ten million, two hundred twelve thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •