Base | Representation |
---|---|
bin | 111000010110011100… |
… | …1010010100011101101 |
3 | 102120100112222210001112 |
4 | 1300230321102203231 |
5 | 3440313122100023 |
6 | 131331533321405 |
7 | 11512540402253 |
oct | 1605471224355 |
9 | 376315883045 |
10 | 121012300013 |
11 | 4735931a100 |
12 | 1b552936265 |
13 | b546b3cc67 |
14 | 5bdd9765d3 |
15 | 3233cb6478 |
hex | 1c2ce528ed |
121012300013 has 12 divisors (see below), whose sum is σ = 140837846940. Its totient is φ = 103539934080.
The previous prime is 121012299973. The next prime is 121012300021. The reversal of 121012300013 is 310003210121.
It can be written as a sum of positive squares in 2 ways, for example, as 111690976804 + 9321323209 = 334202^2 + 96547^2 .
It is not a de Polignac number, because 121012300013 - 28 = 121012299757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012300613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29412698 + ... + 29416811.
It is an arithmetic number, because the mean of its divisors is an integer number (11736487245).
Almost surely, 2121012300013 is an apocalyptic number.
It is an amenable number.
121012300013 is a deficient number, since it is larger than the sum of its proper divisors (19825546927).
121012300013 is a wasteful number, since it uses less digits than its factorization.
121012300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58829548 (or 58829537 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 121012300013 its reverse (310003210121), we get a palindrome (431015510134).
The spelling of 121012300013 in words is "one hundred twenty-one billion, twelve million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •