Base | Representation |
---|---|
bin | 10111001100100111011001… |
… | …001100011110111000111011 |
3 | 111101020012121202000101010011 |
4 | 113030213121030132320323 |
5 | 101333012030020010021 |
6 | 1000552132153202351 |
7 | 30326563214404534 |
oct | 2714473114367073 |
9 | 441205552011104 |
10 | 102022002110011 |
11 | 2a564319534955 |
12 | b53866a1003b7 |
13 | 44c0830aba809 |
14 | 1b29c6983168b |
15 | bbdc5e195de1 |
hex | 5cc9d931ee3b |
102022002110011 has 16 divisors (see below), whose sum is σ = 105590620677600. Its totient is φ = 98456769419008.
The previous prime is 102022002109997. The next prime is 102022002110143. The reversal of 102022002110011 is 110011200220201.
It is a cyclic number.
It is not a de Polignac number, because 102022002110011 - 231 = 102019854626363 is a prime.
It is a super-2 number, since 2×1020220021100112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102022002109973 and 102022002110000.
It is not an unprimeable number, because it can be changed into a prime (102022002110411) 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, 527593335 + ... + 527786671.
It is an arithmetic number, because the mean of its divisors is an integer number (6599413792350).
Almost surely, 2102022002110011 is an apocalyptic number.
102022002110011 is a deficient number, since it is larger than the sum of its proper divisors (3568618567589).
102022002110011 is a wasteful number, since it uses less digits than its factorization.
102022002110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201998.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102022002110011 its reverse (110011200220201), we get a palindrome (212033202330212).
The spelling of 102022002110011 in words is "one hundred two trillion, twenty-two billion, two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •