Base | Representation |
---|---|
bin | 11011010100000000010101… |
… | …001001110001111111010001 |
3 | 120202022112212201201100121022 |
4 | 123110000111021301333101 |
5 | 111221034324024020423 |
6 | 1103251141325005225 |
7 | 34205346101016113 |
oct | 3324002511617721 |
9 | 522275781640538 |
10 | 120122000220113 |
11 | 353024aa606301 |
12 | 115805469b3815 |
13 | 52045c0b37628 |
14 | 2193d15ccb3b3 |
15 | dd49b0013dc8 |
hex | 6d4015271fd1 |
120122000220113 has 2 divisors, whose sum is σ = 120122000220114. Its totient is φ = 120122000220112.
The previous prime is 120122000220107. The next prime is 120122000220151. The reversal of 120122000220113 is 311022000221021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64296775249729 + 55825224970384 = 8018527^2 + 7471628^2 .
It is a cyclic number.
It is not a de Polignac number, because 120122000220113 - 216 = 120122000154577 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120122000220091 and 120122000220100.
It is not a weakly prime, because it can be changed into another prime (120122000226113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60061000110056 + 60061000110057.
It is an arithmetic number, because the mean of its divisors is an integer number (60061000110057).
Almost surely, 2120122000220113 is an apocalyptic number.
It is an amenable number.
120122000220113 is a deficient number, since it is larger than the sum of its proper divisors (1).
120122000220113 is an equidigital number, since it uses as much as digits as its factorization.
120122000220113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 120122000220113 its reverse (311022000221021), we get a palindrome (431144000441134).
The spelling of 120122000220113 in words is "one hundred twenty trillion, one hundred twenty-two billion, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •