Base | Representation |
---|---|
bin | 10111001111010110100110… |
… | …000000111111100010010011 |
3 | 111101220012012010211000020021 |
4 | 113033112212000333202103 |
5 | 101344102312214133021 |
6 | 1001214403135524311 |
7 | 30346303051305544 |
oct | 2717264600774223 |
9 | 441805163730207 |
10 | 102210122021011 |
11 | 2a6270842a5384 |
12 | b56900b089697 |
13 | 45054b0a6a714 |
14 | 1b34dd3bca4cb |
15 | bc3abe683c41 |
hex | 5cf5a603f893 |
102210122021011 has 8 divisors (see below), whose sum is σ = 113918402252880. Its totient is φ = 91134721801728.
The previous prime is 102210122021003. The next prime is 102210122021039. The reversal of 102210122021011 is 110120221012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102210122021011 - 23 = 102210122021003 is a prime.
It is a super-3 number, since 3×1022101220210113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102210122024011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158220002806 + ... + 158220003451.
It is an arithmetic number, because the mean of its divisors is an integer number (14239800281610).
Almost surely, 2102210122021011 is an apocalyptic number.
102210122021011 is a deficient number, since it is larger than the sum of its proper divisors (11708280231869).
102210122021011 is a wasteful number, since it uses less digits than its factorization.
102210122021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316440006293.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102210122021011 its reverse (110120221012201), we get a palindrome (212330343033212).
The spelling of 102210122021011 in words is "one hundred two trillion, two hundred ten billion, one hundred twenty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •