Base | Representation |
---|---|
bin | 10010001100001001110111… |
… | …101100011101101101010111 |
3 | 101111020221011100200120212101 |
4 | 102030021313230131231113 |
5 | 40441210120131000043 |
6 | 442051305131302531 |
7 | 22564546200450514 |
oct | 2214116754355527 |
9 | 344227140616771 |
10 | 80000069000023 |
11 | 23543925397957 |
12 | 8b806712aaa47 |
13 | 3583c88240833 |
14 | 15a8049bd630b |
15 | 93aebaa1824d |
hex | 48c277b1db57 |
80000069000023 has 2 divisors, whose sum is σ = 80000069000024. Its totient is φ = 80000069000022.
The previous prime is 80000069000017. The next prime is 80000069000051. The reversal of 80000069000023 is 32000096000008.
It is an a-pointer prime, because the next prime (80000069000051) can be obtained adding 80000069000023 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 80000069000023 - 225 = 80000035445591 is a prime.
It is a super-2 number, since 2×800000690000232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80000068999955 and 80000069000000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80000069000053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40000034500011 + 40000034500012.
It is an arithmetic number, because the mean of its divisors is an integer number (40000034500012).
Almost surely, 280000069000023 is an apocalyptic number.
80000069000023 is a deficient number, since it is larger than the sum of its proper divisors (1).
80000069000023 is an equidigital number, since it uses as much as digits as its factorization.
80000069000023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 80000069000023 in words is "eighty trillion, sixty-nine million, twenty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •