Base | Representation |
---|---|
bin | 100000110110100… |
… | …0100000001111111 |
3 | 2211211020021021021 |
4 | 1001231010001333 |
5 | 4224144111111 |
6 | 301214445011 |
7 | 36213445003 |
oct | 10155040177 |
9 | 2754207237 |
10 | 1102332031 |
11 | 516268409 |
12 | 269203767 |
13 | 1474b9298 |
14 | a6588703 |
15 | 66b96d71 |
hex | 41b4407f |
1102332031 has 8 divisors (see below), whose sum is σ = 1127669760. Its totient is φ = 1077072888.
The previous prime is 1102331983. The next prime is 1102332061. The reversal of 1102332031 is 1302332011.
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 1102332031 - 217 = 1102200959 is a prime.
It is a super-2 number, since 2×11023320312 = 2430271813137169922, 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 = 1102331996 and 1102332014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102332061) 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, 9210 + ... + 47848.
It is an arithmetic number, because the mean of its divisors is an integer number (140958720).
Almost surely, 21102332031 is an apocalyptic number.
1102332031 is a deficient number, since it is larger than the sum of its proper divisors (25337729).
1102332031 is an equidigital number, since it uses as much as digits as its factorization.
1102332031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39293.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1102332031 is about 33201.3859801063. The cubic root of 1102332031 is about 1033.0090881967.
Adding to 1102332031 its reverse (1302332011), we get a palindrome (2404664042).
The spelling of 1102332031 in words is "one billion, one hundred two million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •