Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …001111110000000111111 |
3 | 10220100202201002210011012 |
4 | 100002123201332000333 |
5 | 121024120434013043 |
6 | 2202150221545435 |
7 | 142424404640000 |
oct | 20023341760077 |
9 | 3810681083135 |
10 | 1102121001023 |
11 | 3954526334a9 |
12 | 15972211527b |
13 | 7cc1133a073 |
14 | 3b4b305d1a7 |
15 | 1da06cb5a18 |
hex | 1009b87e03f |
1102121001023 has 40 divisors (see below), whose sum is σ = 1361939417280. Its totient is φ = 888729354240.
The previous prime is 1102121000983. The next prime is 1102121001031. The reversal of 1102121001023 is 3201001212011.
It is not a de Polignac number, because 1102121001023 - 234 = 1084941131839 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102121000989 and 1102121001007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102121001083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 135875738 + ... + 135883848.
It is an arithmetic number, because the mean of its divisors is an integer number (34048485432).
Almost surely, 21102121001023 is an apocalyptic number.
1102121001023 is a deficient number, since it is larger than the sum of its proper divisors (259818416257).
1102121001023 is an frugal number, since it uses more digits than its factorization.
1102121001023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11485 (or 11464 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1102121001023 its reverse (3201001212011), we get a palindrome (4303122213034).
The spelling of 1102121001023 in words is "one trillion, one hundred two billion, one hundred twenty-one million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •