Base | Representation |
---|---|
bin | 11101100111010010101001… |
… | …011000010101010010110001 |
3 | 122002011011001120112011210012 |
4 | 131213102221120111102301 |
5 | 114032402021040341311 |
6 | 1141001001123544305 |
7 | 36301530416522501 |
oct | 3547225130252261 |
9 | 562134046464705 |
10 | 130243430012081 |
11 | 38554a238912a1 |
12 | 1273607122b095 |
13 | 5789b9745a059 |
14 | 2423b5c1cba01 |
15 | 100cde56d978b |
hex | 7674a96154b1 |
130243430012081 has 2 divisors, whose sum is σ = 130243430012082. Its totient is φ = 130243430012080.
The previous prime is 130243430012057. The next prime is 130243430012107. The reversal of 130243430012081 is 180210034342031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90052204493056 + 40191225519025 = 9489584^2 + 6339655^2 .
It is a cyclic number.
It is not a de Polignac number, because 130243430012081 - 226 = 130243362903217 is a prime.
It is a super-2 number, since 2×1302434300120812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130243430012581) 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, 65121715006040 + 65121715006041.
It is an arithmetic number, because the mean of its divisors is an integer number (65121715006041).
Almost surely, 2130243430012081 is an apocalyptic number.
It is an amenable number.
130243430012081 is a deficient number, since it is larger than the sum of its proper divisors (1).
130243430012081 is an equidigital number, since it uses as much as digits as its factorization.
130243430012081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 32.
The spelling of 130243430012081 in words is "one hundred thirty trillion, two hundred forty-three billion, four hundred thirty million, twelve thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •