Base | Representation |
---|---|
bin | 111000000100010001… |
… | …0110011000110100111 |
3 | 102111210001101212202121 |
4 | 1300020202303012213 |
5 | 3433041010033411 |
6 | 131151225450411 |
7 | 11461453501615 |
oct | 1601042630647 |
9 | 374701355677 |
10 | 120402424231 |
11 | 47076036431 |
12 | 1b402640a07 |
13 | b47a69720b |
14 | 5b8297c6b5 |
15 | 31ea497571 |
hex | 1c088b31a7 |
120402424231 has 4 divisors (see below), whose sum is σ = 127484919792. Its totient is φ = 113319928672.
The previous prime is 120402424223. The next prime is 120402424237. The reversal of 120402424231 is 132424204021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120402424231 - 23 = 120402424223 is a prime.
It is a super-2 number, since 2×1204024242312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120402424196 and 120402424205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120402424237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3541247755 + ... + 3541247788.
It is an arithmetic number, because the mean of its divisors is an integer number (31871229948).
Almost surely, 2120402424231 is an apocalyptic number.
120402424231 is a deficient number, since it is larger than the sum of its proper divisors (7082495561).
120402424231 is an equidigital number, since it uses as much as digits as its factorization.
120402424231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7082495560.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 120402424231 its reverse (132424204021), we get a palindrome (252826628252).
The spelling of 120402424231 in words is "one hundred twenty billion, four hundred two million, four hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •