Base | Representation |
---|---|
bin | 1001011000001110000101… |
… | …10110100001100111011111 |
3 | 2201000120121200211111002121 |
4 | 10230013002312201213133 |
5 | 10200343214201431341 |
6 | 111510132403003411 |
7 | 4225664152431424 |
oct | 454070266414737 |
9 | 81016550744077 |
10 | 20623407061471 |
11 | 66313796a9335 |
12 | 2390b55369567 |
13 | b67a18444b76 |
14 | 51426d0b1d4b |
15 | 25b6deb1e4d1 |
hex | 12c1c2da19df |
20623407061471 has 8 divisors (see below), whose sum is σ = 20645356723200. Its totient is φ = 20601466969080.
The previous prime is 20623407061469. The next prime is 20623407061519. The reversal of 20623407061471 is 17416070432602.
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 20623407061471 - 21 = 20623407061469 is a prime.
It is a super-3 number, since 3×206234070614713 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20623407061871) 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, 1924410 + ... + 6704488.
It is an arithmetic number, because the mean of its divisors is an integer number (2580669590400).
Almost surely, 220623407061471 is an apocalyptic number.
20623407061471 is a deficient number, since it is larger than the sum of its proper divisors (21949661729).
20623407061471 is a wasteful number, since it uses less digits than its factorization.
20623407061471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4784669.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 20623407061471 in words is "twenty trillion, six hundred twenty-three billion, four hundred seven million, sixty-one thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •