Base | Representation |
---|---|
bin | 11011010010010000110001… |
… | …000111001010010100011100 |
3 | 120201220002200100200101120211 |
4 | 123102100301013022110130 |
5 | 111212104011303223400 |
6 | 1103120130533222204 |
7 | 34163605431522250 |
oct | 3322206107122434 |
9 | 521802610611524 |
10 | 120002210211100 |
11 | 35266719238558 |
12 | 11561295491964 |
13 | 51c62102c4ca9 |
14 | 218c1d0808260 |
15 | dd17ed6dcdba |
hex | 6d24311ca51c |
120002210211100 has 72 divisors (see below), whose sum is σ = 297606928187520. Its totient is φ = 41143414902720.
The previous prime is 120002210211097. The next prime is 120002210211101. The reversal of 120002210211100 is 1112012200021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120002210211101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 258445347 + ... + 258909253.
It is an arithmetic number, because the mean of its divisors is an integer number (4133429558160).
Almost surely, 2120002210211100 is an apocalyptic number.
120002210211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120002210211100 is an abundant number, since it is smaller than the sum of its proper divisors (177604717976420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120002210211100 is a wasteful number, since it uses less digits than its factorization.
120002210211100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 833467 (or 833460 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120002210211100 its reverse (1112012200021), we get a palindrome (121114222411121).
The spelling of 120002210211100 in words is "one hundred twenty trillion, two billion, two hundred ten million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •