Base | Representation |
---|---|
bin | 10001110000010110111… |
… | …010110110111010101110 |
3 | 11022122102201100101121220 |
4 | 101300112322312322232 |
5 | 124442334220140420 |
6 | 2332310453204210 |
7 | 154103404263012 |
oct | 21602672667256 |
9 | 4278381311556 |
10 | 1220155240110 |
11 | 430512907324 |
12 | 178583630666 |
13 | 8b0a21a76a1 |
14 | 430ad2a0542 |
15 | 21b143bd840 |
hex | 11c16eb6eae |
1220155240110 has 128 divisors (see below), whose sum is σ = 2999650475520. Its totient is φ = 317539699200.
The previous prime is 1220155240091. The next prime is 1220155240151. The reversal of 1220155240110 is 110425510221.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 340728520 + ... + 340732100.
It is an arithmetic number, because the mean of its divisors is an integer number (23434769340).
Almost surely, 21220155240110 is an apocalyptic number.
1220155240110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1220155240110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1499825237760).
1220155240110 is an abundant number, since it is smaller than the sum of its proper divisors (1779495235410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220155240110 is a wasteful number, since it uses less digits than its factorization.
1220155240110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4994.
The product of its (nonzero) digits is 800, while the sum is 24.
The spelling of 1220155240110 in words is "one trillion, two hundred twenty billion, one hundred fifty-five million, two hundred forty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •