Base | Representation |
---|---|
bin | 10111000010100011000010… |
… | …011001111010111001111101 |
3 | 111021210001202222121200120002 |
4 | 113002203002121322321331 |
5 | 101240143101241201023 |
6 | 555302230305204045 |
7 | 30225601040604464 |
oct | 2702430231727175 |
9 | 437701688550502 |
10 | 101330130022013 |
11 | 2a3179597a9902 |
12 | b44655b630625 |
13 | 447050c52ac79 |
14 | 1b04593bad9db |
15 | baac68953b28 |
hex | 5c28c267ae7d |
101330130022013 has 2 divisors, whose sum is σ = 101330130022014. Its totient is φ = 101330130022012.
The previous prime is 101330130022003. The next prime is 101330130022039. The reversal of 101330130022013 is 310220031033101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89447748813124 + 11882381208889 = 9457682^2 + 3447083^2 .
It is a cyclic number.
It is not a de Polignac number, because 101330130022013 - 26 = 101330130021949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101330130022003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665065011006 + 50665065011007.
It is an arithmetic number, because the mean of its divisors is an integer number (50665065011007).
Almost surely, 2101330130022013 is an apocalyptic number.
It is an amenable number.
101330130022013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330130022013 is an equidigital number, since it uses as much as digits as its factorization.
101330130022013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 101330130022013 its reverse (310220031033101), we get a palindrome (411550161055114).
The spelling of 101330130022013 in words is "one hundred one trillion, three hundred thirty billion, one hundred thirty million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •