Base | Representation |
---|---|
bin | 111000010100101111… |
… | …0110010011011101101 |
3 | 102120012120012201001222 |
4 | 1300221132302123231 |
5 | 3440203441133122 |
6 | 131322125513125 |
7 | 11511243500204 |
oct | 1605136623355 |
9 | 376176181058 |
10 | 120955021037 |
11 | 47329a57604 |
12 | 1b5377127a5 |
13 | b538006686 |
14 | 5bd610623b |
15 | 322dc4eb42 |
hex | 1c297b26ed |
120955021037 has 2 divisors, whose sum is σ = 120955021038. Its totient is φ = 120955021036.
The previous prime is 120955020943. The next prime is 120955021039. The reversal of 120955021037 is 730120559021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99700588516 + 21254432521 = 315754^2 + 145789^2 .
It is a cyclic number.
It is not a de Polignac number, because 120955021037 - 210 = 120955020013 is a prime.
It is a super-2 number, since 2×1209550210372 (a number of 23 digits) contains 22 as substring.
Together with 120955021039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 120955020988 and 120955021006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120955021039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60477510518 + 60477510519.
It is an arithmetic number, because the mean of its divisors is an integer number (60477510519).
Almost surely, 2120955021037 is an apocalyptic number.
It is an amenable number.
120955021037 is a deficient number, since it is larger than the sum of its proper divisors (1).
120955021037 is an equidigital number, since it uses as much as digits as its factorization.
120955021037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 35.
The spelling of 120955021037 in words is "one hundred twenty billion, nine hundred fifty-five million, twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •