Base | Representation |
---|---|
bin | 11011100000110010000011… |
… | …001110010011111101111101 |
3 | 120212102111012110021020210020 |
4 | 123200302003032103331331 |
5 | 111324431020134330023 |
6 | 1105202350353002353 |
7 | 34325651204660631 |
oct | 3340620316237575 |
9 | 525374173236706 |
10 | 121000020230013 |
11 | 35610902a57221 |
12 | 116a2745b533b9 |
13 | 5269339959522 |
14 | 21c460a060dc1 |
15 | dec74ca65de3 |
hex | 6e0c83393f7d |
121000020230013 has 8 divisors (see below), whose sum is σ = 161430140973408. Its totient is φ = 80618289819984.
The previous prime is 121000020229909. The next prime is 121000020230017. The reversal of 121000020230013 is 310032020000121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121000020230013 - 28 = 121000020229757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121000020229974 and 121000020230001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121000020230017) 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, 12097577506 + ... + 12097587507.
It is an arithmetic number, because the mean of its divisors is an integer number (20178767621676).
Almost surely, 2121000020230013 is an apocalyptic number.
It is an amenable number.
121000020230013 is a deficient number, since it is larger than the sum of its proper divisors (40430120743395).
121000020230013 is a wasteful number, since it uses less digits than its factorization.
121000020230013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24195166683.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 121000020230013 its reverse (310032020000121), we get a palindrome (431032040230134).
The spelling of 121000020230013 in words is "one hundred twenty-one trillion, twenty million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •