Base | Representation |
---|---|
bin | 1011111010111101… |
… | …1111010100111011 |
3 | 22021000120221112112 |
4 | 2332233133110323 |
5 | 23023212320443 |
6 | 1245313402535 |
7 | 142205400164 |
oct | 27657372473 |
9 | 8230527475 |
10 | 3200120123 |
11 | 13a2425682 |
12 | 75386944b |
13 | 3bccb1405 |
14 | 22501a76b |
15 | 13ae23b18 |
hex | bebdf53b |
3200120123 has 4 divisors (see below), whose sum is σ = 3201005088. Its totient is φ = 3199235160.
The previous prime is 3200120089. The next prime is 3200120141. The reversal of 3200120123 is 3210210023.
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 3200120123 - 212 = 3200116027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3200120098 and 3200120107.
It is not an unprimeable number, because it can be changed into a prime (3200120323) 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, 437036 + ... + 444297.
It is an arithmetic number, because the mean of its divisors is an integer number (800251272).
Almost surely, 23200120123 is an apocalyptic number.
3200120123 is a deficient number, since it is larger than the sum of its proper divisors (884965).
3200120123 is an equidigital number, since it uses as much as digits as its factorization.
3200120123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 884964.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 3200120123 is about 56569.6042323084. The cubic root of 3200120123 is about 1473.6310382636.
Adding to 3200120123 its reverse (3210210023), we get a palindrome (6410330146).
The spelling of 3200120123 in words is "three billion, two hundred million, one hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •