Base | Representation |
---|---|
bin | 11011010100011011100100… |
… | …000000010001100100110111 |
3 | 120202102100100112022012001102 |
4 | 123110123210000101210313 |
5 | 111222024220021244133 |
6 | 1103312415015520315 |
7 | 34210432513412231 |
oct | 3324334400214467 |
9 | 522370315265042 |
10 | 120151240415543 |
11 | 35313944972977 |
12 | 1158614738909b |
13 | 52072a098130c |
14 | 21954cb471251 |
15 | dd56220a57e8 |
hex | 6d46e4011937 |
120151240415543 has 2 divisors, whose sum is σ = 120151240415544. Its totient is φ = 120151240415542.
The previous prime is 120151240415537. The next prime is 120151240415567. The reversal of 120151240415543 is 345514042151021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120151240415543 - 216 = 120151240350007 is a prime.
It is a super-2 number, since 2×1201512404155432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120151240415497 and 120151240415506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120151240415533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60075620207771 + 60075620207772.
It is an arithmetic number, because the mean of its divisors is an integer number (60075620207772).
Almost surely, 2120151240415543 is an apocalyptic number.
120151240415543 is a deficient number, since it is larger than the sum of its proper divisors (1).
120151240415543 is an equidigital number, since it uses as much as digits as its factorization.
120151240415543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 120151240415543 its reverse (345514042151021), we get a palindrome (465665282566564).
The spelling of 120151240415543 in words is "one hundred twenty trillion, one hundred fifty-one billion, two hundred forty million, four hundred fifteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •