Base | Representation |
---|---|
bin | 11101100100000101011110… |
… | …100110100010100010011011 |
3 | 122001101002102122011101101122 |
4 | 131210011132212202202123 |
5 | 114020244333310104201 |
6 | 1140311445143235455 |
7 | 36246601265342342 |
oct | 3544053646424233 |
9 | 561332378141348 |
10 | 130023132113051 |
11 | 3847a556422131 |
12 | 126bb42ba48b8b |
13 | 5772189b1c848 |
14 | 241722043ab59 |
15 | 10073002a2e1b |
hex | 76415e9a289b |
130023132113051 has 2 divisors, whose sum is σ = 130023132113052. Its totient is φ = 130023132113050.
The previous prime is 130023132113041. The next prime is 130023132113191. The reversal of 130023132113051 is 150311231320031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130023132113051 - 214 = 130023132096667 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130023132113051.
It is not a weakly prime, because it can be changed into another prime (130023132113041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65011566056525 + 65011566056526.
It is an arithmetic number, because the mean of its divisors is an integer number (65011566056526).
Almost surely, 2130023132113051 is an apocalyptic number.
130023132113051 is a deficient number, since it is larger than the sum of its proper divisors (1).
130023132113051 is an equidigital number, since it uses as much as digits as its factorization.
130023132113051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 130023132113051 its reverse (150311231320031), we get a palindrome (280334363433082).
The spelling of 130023132113051 in words is "one hundred thirty trillion, twenty-three billion, one hundred thirty-two million, one hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •