Base | Representation |
---|---|
bin | 1001001011000001100111… |
… | …01011000100011010111111 |
3 | 2122102020101022012122211122 |
4 | 10211200303223010122333 |
5 | 10120431212014202320 |
6 | 110521552502541155 |
7 | 4151144141451221 |
oct | 445406353043277 |
9 | 78366338178748 |
10 | 20170033350335 |
11 | 6477076aa3870 |
12 | 23191074377bb |
13 | b34045116a3b |
14 | 4da3404d6411 |
15 | 24ea075bcd25 |
hex | 125833ac46bf |
20170033350335 has 32 divisors (see below), whose sum is σ = 27110032266240. Its totient is φ = 14278731321600.
The previous prime is 20170033350307. The next prime is 20170033350343. The reversal of 20170033350335 is 53305333007102.
It is not a de Polignac number, because 20170033350335 - 240 = 19070521722559 is a prime.
It is a super-2 number, since 2×201700333503352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20170033350295 and 20170033350304.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 9197507 + ... + 11177396.
It is an arithmetic number, because the mean of its divisors is an integer number (847188508320).
Almost surely, 220170033350335 is an apocalyptic number.
20170033350335 is a deficient number, since it is larger than the sum of its proper divisors (6939998915905).
20170033350335 is a wasteful number, since it uses less digits than its factorization.
20170033350335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20375399.
The product of its (nonzero) digits is 85050, while the sum is 35.
Adding to 20170033350335 its reverse (53305333007102), we get a palindrome (73475366357437).
The spelling of 20170033350335 in words is "twenty trillion, one hundred seventy billion, thirty-three million, three hundred fifty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •