Base | Representation |
---|---|
bin | 1010111010100111011000… |
… | …1110000001000101011001 |
3 | 1120111101120112000102121022 |
4 | 2232221312032001011121 |
5 | 3033120321213322334 |
6 | 41305410532052225 |
7 | 2346060525552266 |
oct | 256516616010531 |
9 | 46441515012538 |
10 | 12002122010969 |
11 | 3908086a87082 |
12 | 141a112464075 |
13 | 690a4521628c |
14 | 2d6c9775826d |
15 | 15c30938482e |
hex | aea76381159 |
12002122010969 has 2 divisors, whose sum is σ = 12002122010970. Its totient is φ = 12002122010968.
The previous prime is 12002122010911. The next prime is 12002122010981. The reversal of 12002122010969 is 96901022120021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11955606305344 + 46515705625 = 3457688^2 + 215675^2 .
It is a cyclic number.
It is not a de Polignac number, because 12002122010969 - 28 = 12002122010713 is a prime.
It is a super-2 number, since 2×120021220109692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12002122010909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001061005484 + 6001061005485.
It is an arithmetic number, because the mean of its divisors is an integer number (6001061005485).
Almost surely, 212002122010969 is an apocalyptic number.
It is an amenable number.
12002122010969 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002122010969 is an equidigital number, since it uses as much as digits as its factorization.
12002122010969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The spelling of 12002122010969 in words is "twelve trillion, two billion, one hundred twenty-two million, ten thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.414 sec. • engine limits •