Base | Representation |
---|---|
bin | 100000110110011… |
… | …1110101010001111 |
3 | 2211211012011002110 |
4 | 1001230332222033 |
5 | 4224142410111 |
6 | 301214155103 |
7 | 36213323604 |
oct | 10154765217 |
9 | 2754164073 |
10 | 1102310031 |
11 | 516252929 |
12 | 2691b2a93 |
13 | 1474ac274 |
14 | a65806ab |
15 | 66b905a6 |
hex | 41b3ea8f |
1102310031 has 32 divisors (see below), whose sum is σ = 1555468288. Its totient is φ = 693463680.
The previous prime is 1102310009. The next prime is 1102310047. The reversal of 1102310031 is 1300132011.
It is not a de Polignac number, because 1102310031 - 29 = 1102309519 is a prime.
It is a super-2 number, since 2×11023100312 = 2430174808886441922, 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 = 1102309989 and 1102310016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102310071) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 748626 + ... + 750096.
It is an arithmetic number, because the mean of its divisors is an integer number (48608384).
Almost surely, 21102310031 is an apocalyptic number.
1102310031 is a deficient number, since it is larger than the sum of its proper divisors (453158257).
1102310031 is a wasteful number, since it uses less digits than its factorization.
1102310031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1711.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1102310031 is about 33201.0546669831. The cubic root of 1102310031 is about 1033.0022159928.
Adding to 1102310031 its reverse (1300132011), we get a palindrome (2402442042).
The spelling of 1102310031 in words is "one billion, one hundred two million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •