Base | Representation |
---|---|
bin | 111000010110000111… |
… | …1011010101000000101 |
3 | 102120022210100002102222 |
4 | 1300230033122220011 |
5 | 3440302314314023 |
6 | 131330502142125 |
7 | 11512345163324 |
oct | 1605417325005 |
9 | 376283302388 |
10 | 121001323013 |
11 | 473531019aa |
12 | 1b54b121945 |
13 | b5447987ac |
14 | 5bdc31a0bb |
15 | 3232d48cc8 |
hex | 1c2c3daa05 |
121001323013 has 8 divisors (see below), whose sum is σ = 121306749600. Its totient is φ = 120696280848.
The previous prime is 121001322997. The next prime is 121001323019. The reversal of 121001323013 is 310323100121.
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 121001323013 - 24 = 121001322997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121001322982 and 121001323000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121001323019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 539495 + ... + 730107.
It is an arithmetic number, because the mean of its divisors is an integer number (15163343700).
Almost surely, 2121001323013 is an apocalyptic number.
It is an amenable number.
121001323013 is a deficient number, since it is larger than the sum of its proper divisors (305426587).
121001323013 is an equidigital number, since it uses as much as digits as its factorization.
121001323013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192211.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 121001323013 its reverse (310323100121), we get a palindrome (431324423134).
The spelling of 121001323013 in words is "one hundred twenty-one billion, one million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •