Base | Representation |
---|---|
bin | 100000001101001110110… |
… | …111110001100010001100 |
3 | 21211120201220100100120002 |
4 | 200031032313301202030 |
5 | 242230144214313400 |
6 | 4412424445543432 |
7 | 315620636336336 |
oct | 40151667614214 |
9 | 7746656310502 |
10 | 2213231401100 |
11 | 783698477515 |
12 | 2b8b32874b78 |
13 | 130925b85165 |
14 | 79199d34456 |
15 | 3c887d61ed5 |
hex | 2034edf188c |
2213231401100 has 36 divisors (see below), whose sum is σ = 4914403129944. Its totient is φ = 864704359680.
The previous prime is 2213231401099. The next prime is 2213231401141. The reversal of 2213231401100 is 11041323122.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 257348189 + ... + 257356788.
It is an arithmetic number, because the mean of its divisors is an integer number (136511198054).
Almost surely, 22213231401100 is an apocalyptic number.
2213231401100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2213231401100 is an abundant number, since it is smaller than the sum of its proper divisors (2701171728844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2213231401100 is a wasteful number, since it uses less digits than its factorization.
2213231401100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514705034 (or 514705027 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2213231401100 its reverse (11041323122), we get a palindrome (2224272724222).
The spelling of 2213231401100 in words is "two trillion, two hundred thirteen billion, two hundred thirty-one million, four hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •