Base | Representation |
---|---|
bin | 1001001101101010011001… |
… | …0100010011001000000111 |
3 | 1022212110010122100221010011 |
4 | 2103122212110103020013 |
5 | 2311433400221114142 |
6 | 33313450052011051 |
7 | 2063614565433016 |
oct | 223324624231007 |
9 | 38773118327104 |
10 | 10130323223047 |
11 | 32562783a9435 |
12 | 11773a8900a87 |
13 | 586392c9c2a1 |
14 | 27044b4d4a7d |
15 | 1287a6351417 |
hex | 936a6513207 |
10130323223047 has 2 divisors, whose sum is σ = 10130323223048. Its totient is φ = 10130323223046.
The previous prime is 10130323222939. The next prime is 10130323223081. The reversal of 10130323223047 is 74032232303101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10130323223047 - 211 = 10130323220999 is a prime.
It is a super-2 number, since 2×101303232230472 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10130323223087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065161611523 + 5065161611524.
It is an arithmetic number, because the mean of its divisors is an integer number (5065161611524).
Almost surely, 210130323223047 is an apocalyptic number.
10130323223047 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130323223047 is an equidigital number, since it uses as much as digits as its factorization.
10130323223047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 31.
Adding to 10130323223047 its reverse (74032232303101), we get a palindrome (84162555526148).
The spelling of 10130323223047 in words is "ten trillion, one hundred thirty billion, three hundred twenty-three million, two hundred twenty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •