Base | Representation |
---|---|
bin | 10010110101010010… |
… | …11000110110110001 |
3 | 222002122010111021012 |
4 | 21122221120312301 |
5 | 131201321434440 |
6 | 4351140040305 |
7 | 505360550600 |
oct | 113251306661 |
9 | 28078114235 |
10 | 10110733745 |
11 | 4319277a02 |
12 | 1b62093095 |
13 | c5191b7b8 |
14 | 6bcb49a37 |
15 | 3e2982e65 |
hex | 25aa58db1 |
10110733745 has 12 divisors (see below), whose sum is σ = 14113759284. Its totient is φ = 6933074400.
The previous prime is 10110733741. The next prime is 10110733751. The reversal of 10110733745 is 54733701101.
10110733745 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4818025744 + 5292708001 = 69412^2 + 72751^2 .
It is not a de Polignac number, because 10110733745 - 22 = 10110733741 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10110733741) 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 11 ways as a sum of consecutive naturals, for example, 20633906 + ... + 20634395.
It is an arithmetic number, because the mean of its divisors is an integer number (1176146607).
Almost surely, 210110733745 is an apocalyptic number.
It is an amenable number.
10110733745 is a deficient number, since it is larger than the sum of its proper divisors (4003025539).
10110733745 is an equidigital number, since it uses as much as digits as its factorization.
10110733745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41268320 (or 41268313 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 32.
The spelling of 10110733745 in words is "ten billion, one hundred ten million, seven hundred thirty-three thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •