Base | Representation |
---|---|
bin | 111000010110111110… |
… | …0110110110110011001 |
3 | 102120101210022122202122 |
4 | 1300231330312312121 |
5 | 3440332140343223 |
6 | 131333405111025 |
7 | 11513144062520 |
oct | 1605574666631 |
9 | 376353278678 |
10 | 121030012313 |
11 | 47368317671 |
12 | 1b558858475 |
13 | b54a702002 |
14 | 5c020674b7 |
15 | 32356145c8 |
hex | 1c2df36d99 |
121030012313 has 8 divisors (see below), whose sum is σ = 146456485632. Its totient is φ = 97637656896.
The previous prime is 121030012309. The next prime is 121030012349. The reversal of 121030012313 is 313210030121.
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 121030012313 - 22 = 121030012309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121030012291 and 121030012300.
It is not an unprimeable number, because it can be changed into a prime (121030012303) 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, 508529345 + ... + 508529582.
It is an arithmetic number, because the mean of its divisors is an integer number (18307060704).
Almost surely, 2121030012313 is an apocalyptic number.
It is an amenable number.
121030012313 is a deficient number, since it is larger than the sum of its proper divisors (25426473319).
121030012313 is a wasteful number, since it uses less digits than its factorization.
121030012313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1017058951.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 121030012313 its reverse (313210030121), we get a palindrome (434240042434).
The spelling of 121030012313 in words is "one hundred twenty-one billion, thirty million, twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •