Base | Representation |
---|---|
bin | 10010110110110000… |
… | …11000000101000001 |
3 | 222010111022021211000 |
4 | 21123120120011001 |
5 | 131213000120304 |
6 | 4352300042213 |
7 | 505600342116 |
oct | 113330300501 |
9 | 28114267730 |
10 | 10123051329 |
11 | 4325220326 |
12 | 1b66233369 |
13 | c54342201 |
14 | 6c063490d |
15 | 3e3ab7939 |
hex | 25b618141 |
10123051329 has 16 divisors (see below), whose sum is σ = 15029947840. Its totient is φ = 6733925280.
The previous prime is 10123051283. The next prime is 10123051349. The reversal of 10123051329 is 92315032101.
10123051329 is a `hidden beast` number, since 1 + 0 + 123 + 0 + 513 + 29 = 666.
10123051329 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10123051329 - 215 = 10123018561 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10123051349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 397867 + ... + 422544.
It is an arithmetic number, because the mean of its divisors is an integer number (939371740).
Almost surely, 210123051329 is an apocalyptic number.
It is an amenable number.
10123051329 is a deficient number, since it is larger than the sum of its proper divisors (4906896511).
10123051329 is an equidigital number, since it uses as much as digits as its factorization.
10123051329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820877 (or 820871 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The spelling of 10123051329 in words is "ten billion, one hundred twenty-three million, fifty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •