Base | Representation |
---|---|
bin | 1001001100000001010000… |
… | …1101101101110100111011 |
3 | 1022202202021212120102220110 |
4 | 2103000110031231310323 |
5 | 2311003101132020331 |
6 | 33252501445555403 |
7 | 2061565340034330 |
oct | 223002415556473 |
9 | 38682255512813 |
10 | 10102102220091 |
11 | 32453063841a2 |
12 | 1171a31715b63 |
13 | 58381635247b |
14 | 26cd31456987 |
15 | 127ba39d2946 |
hex | 9301436dd3b |
10102102220091 has 32 divisors (see below), whose sum is σ = 15504344064000. Its totient is φ = 5731167415680.
The previous prime is 10102102220057. The next prime is 10102102220117. The reversal of 10102102220091 is 19002220120101.
It is not a de Polignac number, because 10102102220091 - 26 = 10102102220027 is a prime.
It is a super-2 number, since 2×101021022200912 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (10102102220591) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5840625 + ... + 7370013.
It is an arithmetic number, because the mean of its divisors is an integer number (484510752000).
Almost surely, 210102102220091 is an apocalyptic number.
10102102220091 is a deficient number, since it is larger than the sum of its proper divisors (5402241843909).
10102102220091 is a wasteful number, since it uses less digits than its factorization.
10102102220091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1531659.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 10102102220091 its reverse (19002220120101), we get a palindrome (29104322340192).
The spelling of 10102102220091 in words is "ten trillion, one hundred two billion, one hundred two million, two hundred twenty thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •