Base | Representation |
---|---|
bin | 111000100000001110… |
… | …0111111001101000111 |
3 | 102121012102102020221222 |
4 | 1301000130333031013 |
5 | 3442001122100111 |
6 | 131424254230555 |
7 | 11523633411050 |
oct | 1610034771507 |
9 | 377172366858 |
10 | 121340425031 |
11 | 47507563301 |
12 | 1b6247b545b |
13 | b599b07487 |
14 | 5c3138b727 |
15 | 32529cd7db |
hex | 1c4073f347 |
121340425031 has 8 divisors (see below), whose sum is σ = 138699356544. Its totient is φ = 103987639800.
The previous prime is 121340425027. The next prime is 121340425033. The reversal of 121340425031 is 130524043121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121340425031 - 22 = 121340425027 is a prime.
It is a super-2 number, since 2×1213404250312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121340425033) 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, 1494185 + ... + 1573298.
It is an arithmetic number, because the mean of its divisors is an integer number (17337419568).
Almost surely, 2121340425031 is an apocalyptic number.
121340425031 is a deficient number, since it is larger than the sum of its proper divisors (17358931513).
121340425031 is an equidigital number, since it uses as much as digits as its factorization.
121340425031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3073141.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 121340425031 its reverse (130524043121), we get a palindrome (251864468152).
The spelling of 121340425031 in words is "one hundred twenty-one billion, three hundred forty million, four hundred twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •