Base | Representation |
---|---|
bin | 1110010100100… |
… | …01000110110111 |
3 | 22101001100011012 |
4 | 13022101012313 |
5 | 221223211043 |
6 | 15530502435 |
7 | 2656051064 |
oct | 712210667 |
9 | 271040135 |
10 | 120132023 |
11 | 618a1a70 |
12 | 34294a1b |
13 | 1bb7204b |
14 | 11d51c6b |
15 | a82ea18 |
hex | 72911b7 |
120132023 has 8 divisors (see below), whose sum is σ = 131135760. Its totient is φ = 109142080.
The previous prime is 120132017. The next prime is 120132029. The reversal of 120132023 is 320231021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (120132017) and next prime (120132029).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120132023 - 210 = 120130999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120131989 and 120132007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120132029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25043 + ... + 29451.
It is an arithmetic number, because the mean of its divisors is an integer number (16391970).
Almost surely, 2120132023 is an apocalyptic number.
120132023 is a deficient number, since it is larger than the sum of its proper divisors (11003737).
120132023 is a wasteful number, since it uses less digits than its factorization.
120132023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6897.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 120132023 is about 10960.4754915104. The cubic root of 120132023 is about 493.4232356346.
Adding to 120132023 its reverse (320231021), we get a palindrome (440363044).
The spelling of 120132023 in words is "one hundred twenty million, one hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •