Base | Representation |
---|---|
bin | 111000010110111110… |
… | …1010011101010010001 |
3 | 102120101210112122122022 |
4 | 1300231331103222101 |
5 | 3440332203132241 |
6 | 131333411421225 |
7 | 11513145063542 |
oct | 1605575235221 |
9 | 376353478568 |
10 | 121030130321 |
11 | 473683982a1 |
12 | 1b5588b4815 |
13 | b54a743939 |
14 | 5c020984c9 |
15 | 323563954b |
hex | 1c2df53a91 |
121030130321 has 4 divisors (see below), whose sum is σ = 127400137200. Its totient is φ = 114660123444.
The previous prime is 121030130269. The next prime is 121030130323. The reversal of 121030130321 is 123031030121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121030130321 - 26 = 121030130257 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 121030130321.
It is not an unprimeable number, because it can be changed into a prime (121030130323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3185003411 + ... + 3185003448.
It is an arithmetic number, because the mean of its divisors is an integer number (31850034300).
Almost surely, 2121030130321 is an apocalyptic number.
It is an amenable number.
121030130321 is a deficient number, since it is larger than the sum of its proper divisors (6370006879).
121030130321 is an equidigital number, since it uses as much as digits as its factorization.
121030130321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6370006878.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 121030130321 its reverse (123031030121), we get a palindrome (244061160442).
The spelling of 121030130321 in words is "one hundred twenty-one billion, thirty million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •