Base | Representation |
---|---|
bin | 111000010110011110… |
… | …1111110111010001101 |
3 | 102120100122022021121222 |
4 | 1300230331332322031 |
5 | 3440313430432003 |
6 | 131332015533125 |
7 | 11512554015050 |
oct | 1605475767215 |
9 | 376318267558 |
10 | 121013530253 |
11 | 47359a8a430 |
12 | 1b55322a1a5 |
13 | b547180c05 |
14 | 5bddbb6a97 |
15 | 3233e5ac38 |
hex | 1c2cf7ee8d |
121013530253 has 16 divisors (see below), whose sum is σ = 150928375680. Its totient is φ = 94262280000.
The previous prime is 121013530247. The next prime is 121013530259. The reversal of 121013530253 is 352035310121.
It is an interprime number because it is at equal distance from previous prime (121013530247) and next prime (121013530259).
It is not a de Polignac number, because 121013530253 - 218 = 121013268109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121013530259) 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 15 ways as a sum of consecutive naturals, for example, 66998 + ... + 496503.
It is an arithmetic number, because the mean of its divisors is an integer number (9433023480).
Almost surely, 2121013530253 is an apocalyptic number.
It is an amenable number.
121013530253 is a deficient number, since it is larger than the sum of its proper divisors (29914845427).
121013530253 is a wasteful number, since it uses less digits than its factorization.
121013530253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566308.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 121013530253 its reverse (352035310121), we get a palindrome (473048840374).
The spelling of 121013530253 in words is "one hundred twenty-one billion, thirteen million, five hundred thirty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •