Base | Representation |
---|---|
bin | 111000100010101100… |
… | …0111010011101101001 |
3 | 102121102012020212000100 |
4 | 1301011120322131221 |
5 | 3442133322234423 |
6 | 131440413300013 |
7 | 11525660352144 |
oct | 1610530723551 |
9 | 377365225010 |
10 | 121423243113 |
11 | 4754a2897a7 |
12 | 1b648494609 |
13 | b5b1013463 |
14 | 5c3c38905b |
15 | 3259ddc343 |
hex | 1c4563a769 |
121423243113 has 6 divisors (see below), whose sum is σ = 175389128954. Its totient is φ = 80948828736.
The previous prime is 121423243103. The next prime is 121423243181. The reversal of 121423243113 is 311342324121.
121423243113 is a `hidden beast` number, since 1 + 21 + 4 + 2 + 324 + 311 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 114821355609 + 6601887504 = 338853^2 + 81252^2 .
It is not a de Polignac number, because 121423243113 - 212 = 121423239017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (121423243103) 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 5 ways as a sum of consecutive naturals, for example, 6745735720 + ... + 6745735737.
Almost surely, 2121423243113 is an apocalyptic number.
It is an amenable number.
121423243113 is a deficient number, since it is larger than the sum of its proper divisors (53965885841).
121423243113 is a wasteful number, since it uses less digits than its factorization.
121423243113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13491471463 (or 13491471460 counting only the distinct ones).
The product of its digits is 3456, while the sum is 27.
Adding to 121423243113 its reverse (311342324121), we get a palindrome (432765567234).
The spelling of 121423243113 in words is "one hundred twenty-one billion, four hundred twenty-three million, two hundred forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •