Base | Representation |
---|---|
bin | 111000100000100000… |
… | …1111100100011111011 |
3 | 102121020002122111002022 |
4 | 1301001001330203323 |
5 | 3442011112113111 |
6 | 131425242025055 |
7 | 11524111642313 |
oct | 1610101744373 |
9 | 377202574068 |
10 | 121350113531 |
11 | 47511a80429 |
12 | 1b627aa818b |
13 | b59bb1a30a |
14 | 5c32790443 |
15 | 32537942db |
hex | 1c4107c8fb |
121350113531 has 8 divisors (see below), whose sum is σ = 121707032304. Its totient is φ = 120993269760.
The previous prime is 121350113527. The next prime is 121350113543. The reversal of 121350113531 is 135311053121.
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 121350113531 - 22 = 121350113527 is a prime.
It is a super-2 number, since 2×1213501135312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121350113531.
It is not an unprimeable number, because it can be changed into a prime (121350115531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6156011 + ... + 6175691.
It is an arithmetic number, because the mean of its divisors is an integer number (15213379038).
Almost surely, 2121350113531 is an apocalyptic number.
121350113531 is a deficient number, since it is larger than the sum of its proper divisors (356918773).
121350113531 is a wasteful number, since it uses less digits than its factorization.
121350113531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37501.
The product of its (nonzero) digits is 1350, while the sum is 26.
Adding to 121350113531 its reverse (135311053121), we get a palindrome (256661166652).
The spelling of 121350113531 in words is "one hundred twenty-one billion, three hundred fifty million, one hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •