Base | Representation |
---|---|
bin | 10111000000101001111100… |
… | …001001001110100100101010 |
3 | 111021022122011010101001122200 |
4 | 113000221330021032210222 |
5 | 101231030302132101442 |
6 | 555122403554201030 |
7 | 30213315605544051 |
oct | 2700517411164452 |
9 | 437278133331580 |
10 | 101200102222122 |
11 | 2a2777a4472262 |
12 | b425311583176 |
13 | 44611899719c7 |
14 | 1adc17ab49398 |
15 | ba76a844d34c |
hex | 5c0a7c24e92a |
101200102222122 has 24 divisors (see below), whose sum is σ = 219268589291076. Its totient is φ = 33733105693056.
The previous prime is 101200102222031. The next prime is 101200102222133. The reversal of 101200102222122 is 221222201002101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 99165567992481 + 2034534229641 = 9958191^2 + 1426371^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 101200102222095 and 101200102222104.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19417903 + ... + 24071874.
Almost surely, 2101200102222122 is an apocalyptic number.
101200102222122 is an abundant number, since it is smaller than the sum of its proper divisors (118068487068954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200102222122 is a wasteful number, since it uses less digits than its factorization.
101200102222122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43619062 (or 43619059 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 101200102222122 its reverse (221222201002101), we get a palindrome (322422303224223).
The spelling of 101200102222122 in words is "one hundred one trillion, two hundred billion, one hundred two million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •