Base | Representation |
---|---|
bin | 10111100100011100… |
… | …00111010010010011 |
3 | 1012122212012121121002 |
4 | 23302032013102103 |
5 | 201403323030343 |
6 | 5451341052215 |
7 | 625366565030 |
oct | 136216072223 |
9 | 35585177532 |
10 | 12653720723 |
11 | 5403771736 |
12 | 255185706b |
13 | 126871c217 |
14 | 88078a387 |
15 | 4e0d508b8 |
hex | 2f2387493 |
12653720723 has 4 divisors (see below), whose sum is σ = 14461395120. Its totient is φ = 10846046328.
The previous prime is 12653720699. The next prime is 12653720731. The reversal of 12653720723 is 32702735621.
It is a happy number.
12653720723 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32702735621 = 617 ⋅53002813.
It is a cyclic number.
It is not a de Polignac number, because 12653720723 - 210 = 12653719699 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12653720743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 903837188 + ... + 903837201.
It is an arithmetic number, because the mean of its divisors is an integer number (3615348780).
Almost surely, 212653720723 is an apocalyptic number.
12653720723 is a deficient number, since it is larger than the sum of its proper divisors (1807674397).
12653720723 is an equidigital number, since it uses as much as digits as its factorization.
12653720723 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1807674396.
The product of its (nonzero) digits is 105840, while the sum is 38.
The spelling of 12653720723 in words is "twelve billion, six hundred fifty-three million, seven hundred twenty thousand, seven hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •