Base | Representation |
---|---|
bin | 11011010010100111001001… |
… | …100001110000011110100011 |
3 | 120201222101201012000201001212 |
4 | 123102213021201300132203 |
5 | 111213002220443001301 |
6 | 1103135143333220335 |
7 | 34165416112633001 |
oct | 3322471141603643 |
9 | 521871635021055 |
10 | 120026242156451 |
11 | 3527593068a814 |
12 | 11565a817916ab |
13 | 51c85700c78b7 |
14 | 218d43039ba71 |
15 | dd22583de4bb |
hex | 6d29c98707a3 |
120026242156451 has 2 divisors, whose sum is σ = 120026242156452. Its totient is φ = 120026242156450.
The previous prime is 120026242156363. The next prime is 120026242156463. The reversal of 120026242156451 is 154651242620021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120026242156451 - 226 = 120026175047587 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120026242156399 and 120026242156408.
It is not a weakly prime, because it can be changed into another prime (120026242186451) 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, 60013121078225 + 60013121078226.
It is an arithmetic number, because the mean of its divisors is an integer number (60013121078226).
Almost surely, 2120026242156451 is an apocalyptic number.
120026242156451 is a deficient number, since it is larger than the sum of its proper divisors (1).
120026242156451 is an equidigital number, since it uses as much as digits as its factorization.
120026242156451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 230400, while the sum is 41.
Adding to 120026242156451 its reverse (154651242620021), we get a palindrome (274677484776472).
The spelling of 120026242156451 in words is "one hundred twenty trillion, twenty-six billion, two hundred forty-two million, one hundred fifty-six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •