Base | Representation |
---|---|
bin | 11011010111101010001000… |
… | …000000010010101010111111 |
3 | 120210012112211210100102112221 |
4 | 123113222020000102222333 |
5 | 111234142434003344201 |
6 | 1104002335312110211 |
7 | 34232444012202226 |
oct | 3327521000225277 |
9 | 523175753312487 |
10 | 120373035215551 |
11 | 35399a10295988 |
12 | 11601125b35367 |
13 | 5222189467351 |
14 | 21a212bd59cbd |
15 | ddb2a3b234a1 |
hex | 6d7a88012abf |
120373035215551 has 2 divisors, whose sum is σ = 120373035215552. Its totient is φ = 120373035215550.
The previous prime is 120373035215453. The next prime is 120373035215567. The reversal of 120373035215551 is 155512530373021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120373035215551 - 227 = 120372900997823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120373035215498 and 120373035215507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120373035215051) 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, 60186517607775 + 60186517607776.
It is an arithmetic number, because the mean of its divisors is an integer number (60186517607776).
Almost surely, 2120373035215551 is an apocalyptic number.
120373035215551 is a deficient number, since it is larger than the sum of its proper divisors (1).
120373035215551 is an equidigital number, since it uses as much as digits as its factorization.
120373035215551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 472500, while the sum is 43.
Adding to 120373035215551 its reverse (155512530373021), we get a palindrome (275885565588572).
The spelling of 120373035215551 in words is "one hundred twenty trillion, three hundred seventy-three billion, thirty-five million, two hundred fifteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •