Base | Representation |
---|---|
bin | 1001001000100000110111… |
… | …10111110100100100000111 |
3 | 2122002222122000001200220022 |
4 | 10210100123313310210013 |
5 | 10113022442040203101 |
6 | 110414201303125355 |
7 | 4142000445126422 |
oct | 444203367644407 |
9 | 78088560050808 |
10 | 20083734694151 |
11 | 6443511720107 |
12 | 230444214385b |
13 | b28b71098c3b |
14 | 4d60b50089b9 |
15 | 24c656170a1b |
hex | 12441bdf4907 |
20083734694151 has 2 divisors, whose sum is σ = 20083734694152. Its totient is φ = 20083734694150.
The previous prime is 20083734694073. The next prime is 20083734694193. The reversal of 20083734694151 is 15149643738002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20083734694151 is a prime.
It is a super-2 number, since 2×200837346941512 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20083734694093 and 20083734694102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20083734694651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10041867347075 + 10041867347076.
It is an arithmetic number, because the mean of its divisors is an integer number (10041867347076).
It is a 1-persistent number, because it is pandigital, but 2⋅20083734694151 = 40167469388302 is not.
Almost surely, 220083734694151 is an apocalyptic number.
20083734694151 is a deficient number, since it is larger than the sum of its proper divisors (1).
20083734694151 is an equidigital number, since it uses as much as digits as its factorization.
20083734694151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4354560, while the sum is 53.
The spelling of 20083734694151 in words is "twenty trillion, eighty-three billion, seven hundred thirty-four million, six hundred ninety-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •