Base | Representation |
---|---|
bin | 10110111111010111111010… |
… | …000110000010010000000100 |
3 | 111021000012210121000102121212 |
4 | 112333113322012002100010 |
5 | 101223104404334014340 |
6 | 555014115440030552 |
7 | 30204050065532465 |
oct | 2677277206022004 |
9 | 437005717012555 |
10 | 101112021001220 |
11 | 2a243404963319 |
12 | b41022b302458 |
13 | 4455a90529a98 |
14 | 1ad7bc2a02d6c |
15 | ba525078da65 |
hex | 5bf5fa182404 |
101112021001220 has 48 divisors (see below), whose sum is σ = 222847946737920. Its totient is φ = 38462717986176.
The previous prime is 101112021001193. The next prime is 101112021001253. The reversal of 101112021001220 is 22100120211101.
It is a junction number, because it is equal to n+sod(n) for n = 101112021001195 and 101112021001204.
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, 635205800 + ... + 635364959.
It is an arithmetic number, because the mean of its divisors is an integer number (4642665557040).
Almost surely, 2101112021001220 is an apocalyptic number.
101112021001220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101112021001220 is an abundant number, since it is smaller than the sum of its proper divisors (121735925736700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112021001220 is a wasteful number, since it uses less digits than its factorization.
101112021001220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1270570964 (or 1270570962 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101112021001220 its reverse (22100120211101), we get a palindrome (123212141212321).
The spelling of 101112021001220 in words is "one hundred one trillion, one hundred twelve billion, twenty-one million, one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •