Base | Representation |
---|---|
bin | 111000010110000111… |
… | …0010000111001010101 |
3 | 102120022202202202011210 |
4 | 1300230032100321111 |
5 | 3440302230133023 |
6 | 131330451452033 |
7 | 11512342465005 |
oct | 1605416207125 |
9 | 376282682153 |
10 | 121001021013 |
11 | 47352a16014 |
12 | 1b54abb7019 |
13 | b5446c11b2 |
14 | 5bdc27c005 |
15 | 3232cd9593 |
hex | 1c2c390e55 |
121001021013 has 8 divisors (see below), whose sum is σ = 161358790528. Its totient is φ = 80655299424.
The previous prime is 121001021003. The next prime is 121001021051. The reversal of 121001021013 is 310120100121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121001021013 - 24 = 121001020997 is a prime.
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 121001021013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121001021003) 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, 2988520 + ... + 3028737.
It is an arithmetic number, because the mean of its divisors is an integer number (20169848816).
Almost surely, 2121001021013 is an apocalyptic number.
It is an amenable number.
121001021013 is a deficient number, since it is larger than the sum of its proper divisors (40357769515).
121001021013 is an equidigital number, since it uses as much as digits as its factorization.
121001021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6023963.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 121001021013 its reverse (310120100121), we get a palindrome (431121121134).
The spelling of 121001021013 in words is "one hundred twenty-one billion, one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •