Base | Representation |
---|---|
bin | 100000110110000… |
… | …1011101011101111 |
3 | 2211210210112200010 |
4 | 1001230023223233 |
5 | 4224114214411 |
6 | 301205504303 |
7 | 36211464060 |
oct | 10154135357 |
9 | 2753715603 |
10 | 1102101231 |
11 | 51611aa70 |
12 | 269112093 |
13 | 14743820a |
14 | a6528567 |
15 | 66b4d7a6 |
hex | 41b0baef |
1102101231 has 16 divisors (see below), whose sum is σ = 1832064768. Its totient is φ = 572520000.
The previous prime is 1102101227. The next prime is 1102101233. The reversal of 1102101231 is 1321012011.
It is not a de Polignac number, because 1102101231 - 22 = 1102101227 is a prime.
It is a super-2 number, since 2×11021012312 = 2429254246743430722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102101233) 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 15 ways as a sum of consecutive naturals, for example, 2385270 + ... + 2385731.
It is an arithmetic number, because the mean of its divisors is an integer number (114504048).
Almost surely, 21102101231 is an apocalyptic number.
1102101231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1102101231 is a deficient number, since it is larger than the sum of its proper divisors (729963537).
1102101231 is a wasteful number, since it uses less digits than its factorization.
1102101231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4771022.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1102101231 is about 33197.9100396395. The cubic root of 1102101231 is about 1032.9369879787.
Adding to 1102101231 its reverse (1321012011), we get a palindrome (2423113242).
The spelling of 1102101231 in words is "one billion, one hundred two million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •