Base | Representation |
---|---|
bin | 111100001100110… |
… | …110010000010111 |
3 | 2121101111100210110 |
4 | 330030312100113 |
5 | 4032030012134 |
6 | 244115454103 |
7 | 34012603044 |
oct | 7414662027 |
9 | 2541440713 |
10 | 1010000919 |
11 | 479134704 |
12 | 2422b7333 |
13 | 13132c2a5 |
14 | 981d21cb |
15 | 5da097e9 |
hex | 3c336417 |
1010000919 has 8 divisors (see below), whose sum is σ = 1347509232. Its totient is φ = 672913280.
The previous prime is 1010000911. The next prime is 1010000921. The reversal of 1010000919 is 9190000101.
1010000919 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010000919 - 23 = 1010000911 is a prime.
It is a super-2 number, since 2×10100009192 = 2040203712761689122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010000895 and 1010000904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010000911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 99522 + ... + 109199.
It is an arithmetic number, because the mean of its divisors is an integer number (168438654).
Almost surely, 21010000919 is an apocalyptic number.
1010000919 is a deficient number, since it is larger than the sum of its proper divisors (337508313).
1010000919 is a wasteful number, since it uses less digits than its factorization.
1010000919 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210337.
The product of its (nonzero) digits is 81, while the sum is 21.
The square root of 1010000919 is about 31780.5116226910. The cubic root of 1010000919 is about 1003.3225878500.
The spelling of 1010000919 in words is "one billion, ten million, nine hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •