Base | Representation |
---|---|
bin | 11101001010100111010… |
… | …11001011111110000000 |
3 | 10112210200020200010010220 |
4 | 32211103223023332000 |
5 | 112404331042210422 |
6 | 2044212301423040 |
7 | 132254513511414 |
oct | 16452353137600 |
9 | 3483606603126 |
10 | 1002131210112 |
11 | 357001a4066a |
12 | 14227786aa80 |
13 | 73667993406 |
14 | 367094d8d44 |
15 | 1b1038e5e5c |
hex | e953acbf80 |
1002131210112 has 32 divisors (see below), whose sum is σ = 2661911027880. Its totient is φ = 334043736576.
The previous prime is 1002131210111. The next prime is 1002131210153. The reversal of 1002131210112 is 2110121312001.
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 1002131210091 and 1002131210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002131210111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1304857963 + ... + 1304858730.
Almost surely, 21002131210112 is an apocalyptic number.
1002131210112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1002131210112 is an abundant number, since it is smaller than the sum of its proper divisors (1659779817768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002131210112 is an equidigital number, since it uses as much as digits as its factorization.
1002131210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609716710 (or 2609716698 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1002131210112 its reverse (2110121312001), we get a palindrome (3112252522113).
The spelling of 1002131210112 in words is "one trillion, two billion, one hundred thirty-one million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •