Base | Representation |
---|---|
bin | 11101100100001110101010… |
… | …110101110010011001110001 |
3 | 122001102000220102102112111201 |
4 | 131210032222311302121301 |
5 | 114020430041241110301 |
6 | 1140320200330211201 |
7 | 36250400662430464 |
oct | 3544165265623161 |
9 | 561360812375451 |
10 | 130033001113201 |
11 | 384837601a1aaa |
12 | 12701324b83b01 |
13 | 57730a06313c4 |
14 | 24178b901d2db |
15 | 10076cb8d6201 |
hex | 7643aad72671 |
130033001113201 has 2 divisors, whose sum is σ = 130033001113202. Its totient is φ = 130033001113200.
The previous prime is 130033001113189. The next prime is 130033001113217. The reversal of 130033001113201 is 102311100330031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125611754752225 + 4421246360976 = 11207665^2 + 2102676^2 .
It is an emirp because it is prime and its reverse (102311100330031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130033001113201 - 237 = 129895562159729 is a prime.
It is not a weakly prime, because it can be changed into another prime (130033001119201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65016500556600 + 65016500556601.
It is an arithmetic number, because the mean of its divisors is an integer number (65016500556601).
Almost surely, 2130033001113201 is an apocalyptic number.
It is an amenable number.
130033001113201 is a deficient number, since it is larger than the sum of its proper divisors (1).
130033001113201 is an equidigital number, since it uses as much as digits as its factorization.
130033001113201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 130033001113201 its reverse (102311100330031), we get a palindrome (232344101443232).
The spelling of 130033001113201 in words is "one hundred thirty trillion, thirty-three billion, one million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •