Base | Representation |
---|---|
bin | 1001001110000001111111… |
… | …01000010100011001111011 |
3 | 2122210002222001102011022021 |
4 | 10213000333220110121323 |
5 | 10124124221132433232 |
6 | 111041233111535311 |
7 | 4161461412445255 |
oct | 447007750243173 |
9 | 78702861364267 |
10 | 20273313171067 |
11 | 6506955840810 |
12 | 233512b68a537 |
13 | b409c42918b8 |
14 | 50133ad9ccd5 |
15 | 25254e721397 |
hex | 12703fa1467b |
20273313171067 has 8 divisors (see below), whose sum is σ = 22478904619632. Its totient is φ = 18128148885600.
The previous prime is 20273313171031. The next prime is 20273313171211. The reversal of 20273313171067 is 76017131337202.
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 20273313171067 - 223 = 20273304782459 is a prime.
It is a super-2 number, since 2×202733131710672 (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 (20273313171467) 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, 15106790068 + ... + 15106791409.
It is an arithmetic number, because the mean of its divisors is an integer number (2809863077454).
Almost surely, 220273313171067 is an apocalyptic number.
20273313171067 is a deficient number, since it is larger than the sum of its proper divisors (2205591448565).
20273313171067 is a wasteful number, since it uses less digits than its factorization.
20273313171067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30213581549.
The product of its (nonzero) digits is 222264, while the sum is 43.
The spelling of 20273313171067 in words is "twenty trillion, two hundred seventy-three billion, three hundred thirteen million, one hundred seventy-one thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •