Base | Representation |
---|---|
bin | 1010111011000101011110… |
… | …1101000110010000000001 |
3 | 1120112011102111011202122022 |
4 | 2232301113231012100001 |
5 | 3033233342144440424 |
6 | 41313224255251225 |
7 | 2346464644410236 |
oct | 256612755062001 |
9 | 46464374152568 |
10 | 12010199999489 |
11 | 391055188144a |
12 | 141b7a7819b15 |
13 | 691731964043 |
14 | 2d742252378d |
15 | 15c62d63795e |
hex | aec57b46401 |
12010199999489 has 2 divisors, whose sum is σ = 12010199999490. Its totient is φ = 12010199999488.
The previous prime is 12010199999471. The next prime is 12010199999561. The reversal of 12010199999489 is 98499999101021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11995194974464 + 15005025025 = 3463408^2 + 122495^2 .
It is a cyclic number.
It is not a de Polignac number, because 12010199999489 - 224 = 12010183222273 is a prime.
It is a super-2 number, since 2×120101999994892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12010199939489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005099999744 + 6005099999745.
It is an arithmetic number, because the mean of its divisors is an integer number (6005099999745).
Almost surely, 212010199999489 is an apocalyptic number.
It is an amenable number.
12010199999489 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010199999489 is an equidigital number, since it uses as much as digits as its factorization.
12010199999489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34012224, while the sum is 71.
The spelling of 12010199999489 in words is "twelve trillion, ten billion, one hundred ninety-nine million, nine hundred ninety-nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.631 sec. • engine limits •