Base | Representation |
---|---|
bin | 1001011000000111111110… |
… | …00111001010001101010011 |
3 | 2201000021010211110022222101 |
4 | 10230003333013022031103 |
5 | 10200320003002301244 |
6 | 111504430452021231 |
7 | 4225516605215032 |
oct | 454037707121523 |
9 | 81007124408871 |
10 | 20620123087699 |
11 | 662aa43a10223 |
12 | 2390399601817 |
13 | b67613c84315 |
14 | 51403aca8719 |
15 | 25b59b6850d4 |
hex | 12c0ff1ca353 |
20620123087699 has 8 divisors (see below), whose sum is σ = 21009612057840. Its totient is φ = 20230650045216.
The previous prime is 20620123087579. The next prime is 20620123087709. The reversal of 20620123087699 is 99678032102602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20620123087699 - 217 = 20620122956627 is a prime.
It is a super-2 number, since 2×206201230876992 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20620123007699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1351989 + ... + 6562630.
It is an arithmetic number, because the mean of its divisors is an integer number (2626201507230).
Almost surely, 220620123087699 is an apocalyptic number.
20620123087699 is a deficient number, since it is larger than the sum of its proper divisors (389488970141).
20620123087699 is an equidigital number, since it uses as much as digits as its factorization.
20620123087699 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7963829.
The product of its (nonzero) digits is 3919104, while the sum is 55.
The spelling of 20620123087699 in words is "twenty trillion, six hundred twenty billion, one hundred twenty-three million, eighty-seven thousand, six hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •