Base | Representation |
---|---|
bin | 1001000110011011011110… |
… | …10111111011010100100111 |
3 | 2121212010210010121000022120 |
4 | 10203031233113323110213 |
5 | 10110334311010102320 |
6 | 110321235213001023 |
7 | 4133554006223322 |
oct | 443155727732447 |
9 | 77763703530276 |
10 | 20012121175335 |
11 | 6416102763513 |
12 | 22b2596a83173 |
13 | b2219a594433 |
14 | 4d283ddbd7b9 |
15 | 24a864090440 |
hex | 12336f5fb527 |
20012121175335 has 8 divisors (see below), whose sum is σ = 32019393880560. Its totient is φ = 10673131293504.
The previous prime is 20012121175331. The next prime is 20012121175363. The reversal of 20012121175335 is 53357112121002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20012121175335 - 22 = 20012121175331 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20012121175296 and 20012121175305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20012121175331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 667070705830 + ... + 667070705859.
It is an arithmetic number, because the mean of its divisors is an integer number (4002424235070).
Almost surely, 220012121175335 is an apocalyptic number.
20012121175335 is a deficient number, since it is larger than the sum of its proper divisors (12007272705225).
20012121175335 is a wasteful number, since it uses less digits than its factorization.
20012121175335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334141411697.
The product of its (nonzero) digits is 12600, while the sum is 33.
Adding to 20012121175335 its reverse (53357112121002), we get a palindrome (73369233296337).
The spelling of 20012121175335 in words is "twenty trillion, twelve billion, one hundred twenty-one million, one hundred seventy-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •