Base | Representation |
---|---|
bin | 10110111110000011010100… |
… | …110011111111110000101100 |
3 | 111020200112101012112121200121 |
4 | 112332003110303333300230 |
5 | 101220112410001432340 |
6 | 554504255452334324 |
7 | 30164353353141415 |
oct | 2676032463776054 |
9 | 436615335477617 |
10 | 101021201202220 |
11 | 2a20893a5090a2 |
12 | b3b6703a743a4 |
13 | 444a348911b50 |
14 | 1ad3648ca480c |
15 | ba2bd747894a |
hex | 5be0d4cffc2c |
101021201202220 has 48 divisors (see below), whose sum is σ = 228464224541280. Its totient is φ = 37299990099456.
The previous prime is 101021201202197. The next prime is 101021201202263. The reversal of 101021201202220 is 22202102120101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101021201202194 and 101021201202203.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84148104 + ... + 85340176.
It is an arithmetic number, because the mean of its divisors is an integer number (4759671344610).
Almost surely, 2101021201202220 is an apocalyptic number.
101021201202220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101021201202220 is an abundant number, since it is smaller than the sum of its proper divisors (127443023339060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021201202220 is a wasteful number, since it uses less digits than its factorization.
101021201202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1518034 (or 1518032 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101021201202220 its reverse (22202102120101), we get a palindrome (123223303322321).
The spelling of 101021201202220 in words is "one hundred one trillion, twenty-one billion, two hundred one million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.556 sec. • engine limits •