Base | Representation |
---|---|
bin | 1001010010000110011101… |
… | …01011100000111110001111 |
3 | 2200021110220200001000000221 |
4 | 10221003032223200332033 |
5 | 10133422113414314320 |
6 | 111225401141332211 |
7 | 4204541636663254 |
oct | 451031653407617 |
9 | 80243820030027 |
10 | 20413152104335 |
11 | 6560195214051 |
12 | 2358257407067 |
13 | b50c4b67b723 |
14 | 50800506142b |
15 | 255ed62293aa |
hex | 1290ceae0f8f |
20413152104335 has 32 divisors (see below), whose sum is σ = 25120318571712. Its totient is φ = 15919276032000.
The previous prime is 20413152104291. The next prime is 20413152104339. The reversal of 20413152104335 is 53340125131402.
It is not a de Polignac number, because 20413152104335 - 215 = 20413152071567 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20413152104335.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20413152104339) 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 31 ways as a sum of consecutive naturals, for example, 377987335 + ... + 378041335.
It is an arithmetic number, because the mean of its divisors is an integer number (785009955366).
Almost surely, 220413152104335 is an apocalyptic number.
20413152104335 is a deficient number, since it is larger than the sum of its proper divisors (4707166467377).
20413152104335 is a wasteful number, since it uses less digits than its factorization.
20413152104335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65803.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 20413152104335 its reverse (53340125131402), we get a palindrome (73753277235737).
The spelling of 20413152104335 in words is "twenty trillion, four hundred thirteen billion, one hundred fifty-two million, one hundred four thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •