Base | Representation |
---|---|
bin | 10110101111100000111101… |
… | …000000110110010101111100 |
3 | 111010011000211121222012201000 |
4 | 112233200331000312111330 |
5 | 101102231002314201022 |
6 | 552421324025450300 |
7 | 30032236622205363 |
oct | 2657407500662574 |
9 | 433130747865630 |
10 | 100022222022012 |
11 | 29963205837224 |
12 | b274b87940990 |
13 | 43a7093c92ab4 |
14 | 1a9b15c2687da |
15 | b86c1a6576ac |
hex | 5af83d03657c |
100022222022012 has 48 divisors (see below), whose sum is σ = 262599363980800. Its totient is φ = 32918705979120.
The previous prime is 100022222021989. The next prime is 100022222022043. The reversal of 100022222022012 is 210220222220001.
100022222022012 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 222 + 220 + 220 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 5861584414 + ... + 5861601477.
Almost surely, 2100022222022012 is an apocalyptic number.
100022222022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100022222022012 is an abundant number, since it is smaller than the sum of its proper divisors (162577141958788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022222022012 is a wasteful number, since it uses less digits than its factorization.
100022222022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11723185983 (or 11723185975 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 100022222022012 its reverse (210220222220001), we get a palindrome (310242444242013).
The spelling of 100022222022012 in words is "one hundred trillion, twenty-two billion, two hundred twenty-two million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •