Base | Representation |
---|---|
bin | 1001001101101010010100… |
… | …0011110011100011100011 |
3 | 1022212110002011122220012201 |
4 | 2103122211003303203203 |
5 | 2311433324320402321 |
6 | 33313444015434031 |
7 | 2063614221200365 |
oct | 223324503634343 |
9 | 38773064586181 |
10 | 10130302122211 |
11 | 32562674a7027 |
12 | 11773a1825917 |
13 | 58638b7c1a9b |
14 | 2704487a0d35 |
15 | 1287a4584291 |
hex | 936a50f38e3 |
10130302122211 has 8 divisors (see below), whose sum is σ = 10664296503840. Its totient is φ = 9604103279232.
The previous prime is 10130302122169. The next prime is 10130302122293. The reversal of 10130302122211 is 11222120303101.
10130302122211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10130302122211 - 223 = 10130293733603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10130302152211) 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, 1948881996 + ... + 1948887193.
It is an arithmetic number, because the mean of its divisors is an integer number (1333037062980).
Almost surely, 210130302122211 is an apocalyptic number.
10130302122211 is a deficient number, since it is larger than the sum of its proper divisors (533994381629).
10130302122211 is a wasteful number, since it uses less digits than its factorization.
10130302122211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3897769325.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10130302122211 its reverse (11222120303101), we get a palindrome (21352422425312).
The spelling of 10130302122211 in words is "ten trillion, one hundred thirty billion, three hundred two million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •