Base | Representation |
---|---|
bin | 111100110000010… |
… | …011110100000111 |
3 | 2122000222122122220 |
4 | 330300103310013 |
5 | 4041420001111 |
6 | 245051023423 |
7 | 34154611314 |
oct | 7460236407 |
9 | 2560878586 |
10 | 1019297031 |
11 | 483403a45 |
12 | 24543ab73 |
13 | 13323564c |
14 | 99531d0b |
15 | 5e743e06 |
hex | 3cc13d07 |
1019297031 has 8 divisors (see below), whose sum is σ = 1362914160. Its totient is φ = 677605632.
The previous prime is 1019296997. The next prime is 1019297051. The reversal of 1019297031 is 1307929101.
1019297031 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 not a de Polignac number, because 1019297031 - 225 = 985742599 is a prime.
It is a super-2 number, since 2×10192970312 = 2077932874810829922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1019296983 and 1019297001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1019297051) 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, 480196 + ... + 482313.
It is an arithmetic number, because the mean of its divisors is an integer number (170364270).
Almost surely, 21019297031 is an apocalyptic number.
1019297031 is a deficient number, since it is larger than the sum of its proper divisors (343617129).
1019297031 is an equidigital number, since it uses as much as digits as its factorization.
1019297031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962865.
The product of its (nonzero) digits is 3402, while the sum is 33.
The square root of 1019297031 is about 31926.4315419058. The cubic root of 1019297031 is about 1006.3914065590.
The spelling of 1019297031 in words is "one billion, nineteen million, two hundred ninety-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •