Base | Representation |
---|---|
bin | 10100010101101010… |
… | …00110010101111010 |
3 | 1001011222020021000212 |
4 | 22022311012111322 |
5 | 134330243010020 |
6 | 5003254231122 |
7 | 534404621654 |
oct | 121265062572 |
9 | 31158207025 |
10 | 10919110010 |
11 | 46a3609a66 |
12 | 21489554a2 |
13 | 1050245153 |
14 | 7582556d4 |
15 | 43d911cc5 |
hex | 28ad4657a |
10919110010 has 8 divisors (see below), whose sum is σ = 19654398036. Its totient is φ = 4367644000.
The previous prime is 10919110001. The next prime is 10919110063. The reversal of 10919110010 is 1001191901.
It is a happy number.
10919110010 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 10888296409 + 30813601 = 104347^2 + 5551^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
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, 545955491 + ... + 545955510.
Almost surely, 210919110010 is an apocalyptic number.
10919110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10919110010 is a deficient number, since it is larger than the sum of its proper divisors (8735288026).
10919110010 is a wasteful number, since it uses less digits than its factorization.
10919110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091911008.
The product of its (nonzero) digits is 81, while the sum is 23.
The spelling of 10919110010 in words is "ten billion, nine hundred nineteen million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •