Base | Representation |
---|---|
bin | 11101001010010111110… |
… | …11010100010111111000 |
3 | 10112210100012001222202111 |
4 | 32211023323110113320 |
5 | 112404044303033422 |
6 | 2044151335342104 |
7 | 132251344564633 |
oct | 16451373242770 |
9 | 3483305058674 |
10 | 1002001221112 |
11 | 356a45626a41 |
12 | 142240221934 |
13 | 73646a7c948 |
14 | 366d613cc1a |
15 | 1b0e72baa77 |
hex | e94bed45f8 |
1002001221112 has 32 divisors (see below), whose sum is σ = 1898533929600. Its totient is φ = 495727755264.
The previous prime is 1002001221043. The next prime is 1002001221113. The reversal of 1002001221112 is 2111221002001.
It is a super-2 number, since 2×10020012211122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002001221092 and 1002001221101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002001221113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3488089 + ... + 3764407.
It is an arithmetic number, because the mean of its divisors is an integer number (59329185300).
Almost surely, 21002001221112 is an apocalyptic number.
It is an amenable number.
1002001221112 is a deficient number, since it is larger than the sum of its proper divisors (896532708488).
1002001221112 is a wasteful number, since it uses less digits than its factorization.
1002001221112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281095 (or 281091 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1002001221112 its reverse (2111221002001), we get a palindrome (3113222223113).
The spelling of 1002001221112 in words is "one trillion, two billion, one million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •