Base | Representation |
---|---|
bin | 10110101111100001000011… |
… | …011101100110001010011100 |
3 | 111010011001010011120022002210 |
4 | 112233201003131212022130 |
5 | 101102231213014034322 |
6 | 552421342452520420 |
7 | 30032242404660060 |
oct | 2657410335461234 |
9 | 433131104508083 |
10 | 100022330221212 |
11 | 29963260918953 |
12 | b274bb8020110 |
13 | 43a70b05175a9 |
14 | 1a9b16c791aa0 |
15 | b86c24dcb70c |
hex | 5af84376629c |
100022330221212 has 48 divisors (see below), whose sum is σ = 267411885511680. Its totient is φ = 28504343821632.
The previous prime is 100022330221201. The next prime is 100022330221327. The reversal of 100022330221212 is 212122033220001.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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, 1530484068 + ... + 1530549419.
It is an arithmetic number, because the mean of its divisors is an integer number (5571080948160).
Almost surely, 2100022330221212 is an apocalyptic number.
100022330221212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100022330221212 is an abundant number, since it is smaller than the sum of its proper divisors (167389555290468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022330221212 is a wasteful number, since it uses less digits than its factorization.
100022330221212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3061033890 (or 3061033888 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 100022330221212 its reverse (212122033220001), we get a palindrome (312144363441213).
The spelling of 100022330221212 in words is "one hundred trillion, twenty-two billion, three hundred thirty million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •