Base | Representation |
---|---|
bin | 111101010010101… |
… | …101000000101011 |
3 | 2122122221201102112 |
4 | 331102231000223 |
5 | 4101222010011 |
6 | 250012152535 |
7 | 34324342316 |
oct | 7522550053 |
9 | 2578851375 |
10 | 1028313131 |
11 | 48850196a |
12 | 24846874b |
13 | 135071411 |
14 | 9a7db97d |
15 | 6042558b |
hex | 3d4ad02b |
1028313131 has 4 divisors (see below), whose sum is σ = 1029975000. Its totient is φ = 1026651264.
The previous prime is 1028313107. The next prime is 1028313133. The reversal of 1028313131 is 1313138201.
1028313131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1028313131 - 222 = 1024118827 is a prime.
It is a super-2 number, since 2×10283131312 = 2114855790774046322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1028313097 and 1028313106.
It is not an unprimeable number, because it can be changed into a prime (1028313133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 830006 + ... + 831243.
It is an arithmetic number, because the mean of its divisors is an integer number (257493750).
Almost surely, 21028313131 is an apocalyptic number.
1028313131 is a deficient number, since it is larger than the sum of its proper divisors (1661869).
1028313131 is an equidigital number, since it uses as much as digits as its factorization.
1028313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1661868.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 1028313131 is about 32067.3218557459. The cubic root of 1028313131 is about 1009.3500150832.
The spelling of 1028313131 in words is "one billion, twenty-eight million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.243 sec. • engine limits •