Base | Representation |
---|---|
bin | 10110010111101101… |
… | …11100001111100001 |
3 | 1011000000010220100211 |
4 | 23023312330033201 |
5 | 144044042040334 |
6 | 5303430214121 |
7 | 603423160462 |
oct | 131366741741 |
9 | 34000126324 |
10 | 12010111969 |
11 | 5103438979 |
12 | 23b21b4341 |
13 | 119529533b |
14 | 81d0d0d69 |
15 | 4a45bba64 |
hex | 2cbdbc3e1 |
12010111969 has 2 divisors, whose sum is σ = 12010111970. Its totient is φ = 12010111968.
The previous prime is 12010111951. The next prime is 12010112041. The reversal of 12010111969 is 96911101021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6205500625 + 5804611344 = 78775^2 + 76188^2 .
It is a cyclic number.
It is not a de Polignac number, because 12010111969 - 217 = 12009980897 is a prime.
It is a super-2 number, since 2×120101119692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12010111969.
It is not a weakly prime, because it can be changed into another prime (12010111469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005055984 + 6005055985.
It is an arithmetic number, because the mean of its divisors is an integer number (6005055985).
Almost surely, 212010111969 is an apocalyptic number.
It is an amenable number.
12010111969 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010111969 is an equidigital number, since it uses as much as digits as its factorization.
12010111969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 31.
The spelling of 12010111969 in words is "twelve billion, ten million, one hundred eleven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •