Base | Representation |
---|---|
bin | 1010111010100011100101… |
… | …1000000001000001110000 |
3 | 1120111021221101012222101110 |
4 | 2232220321120001001300 |
5 | 3033111223403101000 |
6 | 41305121345033320 |
7 | 2346023322155202 |
oct | 256507130010160 |
9 | 46437841188343 |
10 | 12001101222000 |
11 | 3907702854230 |
12 | 1419a88625840 |
13 | 6909118aa837 |
14 | 2d6bdbd58772 |
15 | 15c299948850 |
hex | aea39601070 |
12001101222000 has 160 divisors (see below), whose sum is σ = 42208964239104. Its totient is φ = 2909357856000.
The previous prime is 12001101221969. The next prime is 12001101222007. The reversal of 12001101222000 is 22210110021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001101222007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90851434 + ... + 90983433.
Almost surely, 212001101222000 is an apocalyptic number.
12001101222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12001101222000 is an abundant number, since it is smaller than the sum of its proper divisors (30207863017104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001101222000 is a wasteful number, since it uses less digits than its factorization.
12001101222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181834904 (or 181834888 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12001101222000 its reverse (22210110021), we get a palindrome (12023311332021).
The spelling of 12001101222000 in words is "twelve trillion, one billion, one hundred one million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •