Base | Representation |
---|---|
bin | 111000000100011111… |
… | …1101111001100111111 |
3 | 102111210120200022001222 |
4 | 1300020333233030333 |
5 | 3433044430313211 |
6 | 131152100223555 |
7 | 11461605126044 |
oct | 1601077571477 |
9 | 374716608058 |
10 | 120410010431 |
11 | 4707a348017 |
12 | 1b40509abbb |
13 | b47c1221a9 |
14 | 5b839951cb |
15 | 31eae951db |
hex | 1c08fef33f |
120410010431 has 4 divisors (see below), whose sum is σ = 120820966392. Its totient is φ = 119999054472.
The previous prime is 120410010403. The next prime is 120410010439. The reversal of 120410010431 is 134010014021.
It is a happy number.
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 120410010431 - 210 = 120410009407 is a prime.
It is a super-2 number, since 2×1204100104312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120410010439) 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 in 3 ways as a sum of consecutive naturals, for example, 205477541 + ... + 205478126.
It is an arithmetic number, because the mean of its divisors is an integer number (30205241598).
Almost surely, 2120410010431 is an apocalyptic number.
120410010431 is a deficient number, since it is larger than the sum of its proper divisors (410955961).
120410010431 is an equidigital number, since it uses as much as digits as its factorization.
120410010431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410955960.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 120410010431 its reverse (134010014021), we get a palindrome (254420024452).
The spelling of 120410010431 in words is "one hundred twenty billion, four hundred ten million, ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •