Base | Representation |
---|---|
bin | 111101001110110… |
… | …110101001010011 |
3 | 2122121001110012000 |
4 | 331032312221103 |
5 | 4100442212034 |
6 | 245534405043 |
7 | 34312640310 |
oct | 7516665123 |
9 | 2577043160 |
10 | 1027304019 |
11 | 487982795 |
12 | 248060783 |
13 | 134aaa001 |
14 | 9a617d07 |
15 | 602c6599 |
hex | 3d3b6a53 |
1027304019 has 32 divisors (see below), whose sum is σ = 1742384640. Its totient is φ = 586007136.
The previous prime is 1027304017. The next prime is 1027304021. The reversal of 1027304019 is 9104037201.
It is an interprime number because it is at equal distance from previous prime (1027304017) and next prime (1027304021).
It is not a de Polignac number, because 1027304019 - 21 = 1027304017 is a prime.
It is a super-2 number, since 2×10273040192 = 2110707094907104722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1027303983 and 1027304001.
It is not an unprimeable number, because it can be changed into a prime (1027304017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111424 + ... + 120290.
It is an arithmetic number, because the mean of its divisors is an integer number (54449520).
Almost surely, 21027304019 is an apocalyptic number.
1027304019 is a deficient number, since it is larger than the sum of its proper divisors (715080621).
1027304019 is an equidigital number, since it uses as much as digits as its factorization.
1027304019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9496 (or 9490 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 1027304019 is about 32051.5837206214. The cubic root of 1027304019 is about 1009.0197393660.
The spelling of 1027304019 in words is "one billion, twenty-seven million, three hundred four thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •