Base | Representation |
---|---|
bin | 11101000111000011101… |
… | …01100010001110110000 |
3 | 10112121202010212122121020 |
4 | 32203201311202032300 |
5 | 112341423124220422 |
6 | 2043254554055440 |
7 | 132156262641120 |
oct | 16434165421660 |
9 | 3477663778536 |
10 | 1000221320112 |
11 | 35621194aa83 |
12 | 141a2411a580 |
13 | 734220a90a1 |
14 | 365a79b8c80 |
15 | 1b040dd295c |
hex | e8e1d623b0 |
1000221320112 has 40 divisors (see below), whose sum is σ = 2953034374656. Its totient is φ = 285777519936.
The previous prime is 1000221320099. The next prime is 1000221320113. The reversal of 1000221320112 is 2110231220001.
It is a junction number, because it is equal to n+sod(n) for n = 1000221320091 and 1000221320100.
It is not an unprimeable number, because it can be changed into a prime (1000221320113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1488424248 + ... + 1488424919.
Almost surely, 21000221320112 is an apocalyptic number.
1000221320112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1000221320112 is an abundant number, since it is smaller than the sum of its proper divisors (1952813054544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000221320112 is a wasteful number, since it uses less digits than its factorization.
1000221320112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2976849185 (or 2976849179 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1000221320112 its reverse (2110231220001), we get a palindrome (3110452540113).
The spelling of 1000221320112 in words is "one trillion, two hundred twenty-one million, three hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •