Base | Representation |
---|---|
bin | 110111111100000010… |
… | …1100001101000000101 |
3 | 102111001210212002010021 |
4 | 1233320011201220011 |
5 | 3432004314040023 |
6 | 131104003455141 |
7 | 11451561554515 |
oct | 1577005415005 |
9 | 374053762107 |
10 | 120126315013 |
11 | 46a4419a4a1 |
12 | 1b3460874b1 |
13 | b435412793 |
14 | 5b58027845 |
15 | 31d110735d |
hex | 1bf8161a05 |
120126315013 has 2 divisors, whose sum is σ = 120126315014. Its totient is φ = 120126315012.
The previous prime is 120126315011. The next prime is 120126315017. The reversal of 120126315013 is 310513621021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111715040644 + 8411274369 = 334238^2 + 91713^2 .
It is a cyclic number.
It is not a de Polignac number, because 120126315013 - 21 = 120126315011 is a prime.
Together with 120126315011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120126315011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60063157506 + 60063157507.
It is an arithmetic number, because the mean of its divisors is an integer number (60063157507).
Almost surely, 2120126315013 is an apocalyptic number.
It is an amenable number.
120126315013 is a deficient number, since it is larger than the sum of its proper divisors (1).
120126315013 is an equidigital number, since it uses as much as digits as its factorization.
120126315013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 120126315013 its reverse (310513621021), we get a palindrome (430639936034).
The spelling of 120126315013 in words is "one hundred twenty billion, one hundred twenty-six million, three hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •