Base | Representation |
---|---|
bin | 10110100011000101… |
… | …11001011001010011 |
3 | 1011020122200011120101 |
4 | 23101202321121103 |
5 | 144243003130343 |
6 | 5321115153231 |
7 | 605662141222 |
oct | 132142713123 |
9 | 34218604511 |
10 | 12105520723 |
11 | 515228398a |
12 | 241a145817 |
13 | 11abc8c11a |
14 | 82ba48cb9 |
15 | 4acb65e4d |
hex | 2d18b9653 |
12105520723 has 16 divisors (see below), whose sum is σ = 12583744992. Its totient is φ = 11636352000.
The previous prime is 12105520697. The next prime is 12105520733. The reversal of 12105520723 is 32702550121.
12105520723 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12105520723 - 217 = 12105389651 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12105520691 and 12105520700.
It is not an unprimeable number, because it can be changed into a prime (12105520733) 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 15 ways as a sum of consecutive naturals, for example, 4431268 + ... + 4433998.
It is an arithmetic number, because the mean of its divisors is an integer number (786484062).
Almost surely, 212105520723 is an apocalyptic number.
12105520723 is a deficient number, since it is larger than the sum of its proper divisors (478224269).
12105520723 is a wasteful number, since it uses less digits than its factorization.
12105520723 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4326.
The product of its (nonzero) digits is 4200, while the sum is 28.
It can be divided in two parts, 121055 and 20723, that added together give a triangular number (141778 = T532).
The spelling of 12105520723 in words is "twelve billion, one hundred five million, five hundred twenty thousand, seven hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •