Base | Representation |
---|---|
bin | 11101100011111001100011… |
… | …000011110101110101000111 |
3 | 122001022212100212200021112102 |
4 | 131203321203003311311013 |
5 | 114020042114413014343 |
6 | 1140301530054142315 |
7 | 36245635656235466 |
oct | 3543714303656507 |
9 | 561285325607472 |
10 | 130010322001223 |
11 | 38475082453554 |
12 | 126b8a5595199b |
13 | 5770bc7ba4711 |
14 | 2416766dc09dd |
15 | 1006d0085e3b8 |
hex | 763e630f5d47 |
130010322001223 has 2 divisors, whose sum is σ = 130010322001224. Its totient is φ = 130010322001222.
The previous prime is 130010322001151. The next prime is 130010322001271. The reversal of 130010322001223 is 322100223010031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130010322001223 - 216 = 130010321935687 is a prime.
It is a super-2 number, since 2×1300103220012232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130010322001195 and 130010322001204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130010322004223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65005161000611 + 65005161000612.
It is an arithmetic number, because the mean of its divisors is an integer number (65005161000612).
Almost surely, 2130010322001223 is an apocalyptic number.
130010322001223 is a deficient number, since it is larger than the sum of its proper divisors (1).
130010322001223 is an equidigital number, since it uses as much as digits as its factorization.
130010322001223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130010322001223 its reverse (322100223010031), we get a palindrome (452110545011254).
The spelling of 130010322001223 in words is "one hundred thirty trillion, ten billion, three hundred twenty-two million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •