Base | Representation |
---|---|
bin | 10000000010100111011… |
… | …001011110011101110001 |
3 | 10220101021120202010022001 |
4 | 100002213121132131301 |
5 | 121030022421214413 |
6 | 2202222053214001 |
7 | 142432343156041 |
oct | 20024731363561 |
9 | 3811246663261 |
10 | 1102320101233 |
11 | 395544a6142a |
12 | 159778931301 |
13 | 7cc4366a940 |
14 | 3b4d1689721 |
15 | 1da194e34dd |
hex | 100a765e771 |
1102320101233 has 16 divisors (see below), whose sum is σ = 1225454820352. Its totient is φ = 984665160000.
The previous prime is 1102320101219. The next prime is 1102320101251. The reversal of 1102320101233 is 3321010232011.
It is a cyclic number.
It is not a de Polignac number, because 1102320101233 - 229 = 1101783230321 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1102320101233.
It is not an unprimeable number, because it can be changed into a prime (1102320401233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20732383 + ... + 20785483.
It is an arithmetic number, because the mean of its divisors is an integer number (76590926272).
Almost surely, 21102320101233 is an apocalyptic number.
1102320101233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1102320101233 is a deficient number, since it is larger than the sum of its proper divisors (123134719119).
1102320101233 is a wasteful number, since it uses less digits than its factorization.
1102320101233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104656.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1102320101233 its reverse (3321010232011), we get a palindrome (4423330333244).
The spelling of 1102320101233 in words is "one trillion, one hundred two billion, three hundred twenty million, one hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •