Base | Representation |
---|---|
bin | 11101001010100110001… |
… | …00101100110101100001 |
3 | 10112210122112200112122120 |
4 | 32211103010230311201 |
5 | 112404321001333441 |
6 | 2044211301254453 |
7 | 132254331661431 |
oct | 16452304546541 |
9 | 3483575615576 |
10 | 1002121121121 |
11 | 356aa727a65a |
12 | 142274404429 |
13 | 736658701b3 |
14 | 367080302c1 |
15 | 1b102aa1966 |
hex | e95312cd61 |
1002121121121 has 32 divisors (see below), whose sum is σ = 1400095488000. Its totient is φ = 637567905744.
The previous prime is 1002121121021. The next prime is 1002121121123. The reversal of 1002121121121 is 1211211212001.
It is a happy number.
It is not a de Polignac number, because 1002121121121 - 226 = 1002054012257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1002121121121.
It is not an unprimeable number, because it can be changed into a prime (1002121121123) 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 31 ways as a sum of consecutive naturals, for example, 15992670 + ... + 16055208.
It is an arithmetic number, because the mean of its divisors is an integer number (43752984000).
Almost surely, 21002121121121 is an apocalyptic number.
It is an amenable number.
1002121121121 is a deficient number, since it is larger than the sum of its proper divisors (397974366879).
1002121121121 is an frugal number, since it uses more digits than its factorization.
1002121121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63050 (or 63004 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1002121121121 its reverse (1211211212001), we get a palindrome (2213332333122).
The spelling of 1002121121121 in words is "one trillion, two billion, one hundred twenty-one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •