Base | Representation |
---|---|
bin | 11101101000010000110000… |
… | …011111100001110111110011 |
3 | 122002101112012102000021010220 |
4 | 131220100300133201313303 |
5 | 114040000112030112321 |
6 | 1141051350542224123 |
7 | 36306411166426242 |
oct | 3550206037416763 |
9 | 562345172007126 |
10 | 130310121332211 |
11 | 38580237350197 |
12 | 12746b83b85043 |
13 | 5793265273662 |
14 | 2427087608959 |
15 | 100e9ea5d09c6 |
hex | 7684307e1df3 |
130310121332211 has 8 divisors (see below), whose sum is σ = 175467094071504. Its totient is φ = 86013281407200.
The previous prime is 130310121332057. The next prime is 130310121332219. The reversal of 130310121332211 is 112233121013031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130310121332211 - 215 = 130310121299443 is a prime.
It is a super-2 number, since 2×1303101213322112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130310121332219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215033203216 + ... + 215033203821.
It is an arithmetic number, because the mean of its divisors is an integer number (21933386758938).
Almost surely, 2130310121332211 is an apocalyptic number.
130310121332211 is a deficient number, since it is larger than the sum of its proper divisors (45156972739293).
130310121332211 is a wasteful number, since it uses less digits than its factorization.
130310121332211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430066407141.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 130310121332211 its reverse (112233121013031), we get a palindrome (242543242345242).
The spelling of 130310121332211 in words is "one hundred thirty trillion, three hundred ten billion, one hundred twenty-one million, three hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •