Base | Representation |
---|---|
bin | 1001010011010101011000… |
… | …10011110000100010011011 |
3 | 2200102112021201100102212221 |
4 | 10221222230103300202123 |
5 | 10140120403412434001 |
6 | 111301045530244511 |
7 | 4210601660500420 |
oct | 451525423604233 |
9 | 80375251312787 |
10 | 20455525124251 |
11 | 6577159727078 |
12 | 2364501b86737 |
13 | b54c42261389 |
14 | 50a0a4867d47 |
15 | 2571662081a1 |
hex | 129aac4f089b |
20455525124251 has 32 divisors (see below), whose sum is σ = 24286730244480. Its totient is φ = 16856724326400.
The previous prime is 20455525124219. The next prime is 20455525124257. The reversal of 20455525124251 is 15242152555402.
It is not a de Polignac number, because 20455525124251 - 25 = 20455525124219 is a prime.
It is a super-2 number, since 2×204555251242512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20455525124198 and 20455525124207.
It is not an unprimeable number, because it can be changed into a prime (20455525124257) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 715288885 + ... + 715317481.
It is an arithmetic number, because the mean of its divisors is an integer number (758960320140).
Almost surely, 220455525124251 is an apocalyptic number.
20455525124251 is a deficient number, since it is larger than the sum of its proper divisors (3831205120229).
20455525124251 is a wasteful number, since it uses less digits than its factorization.
20455525124251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43495.
The product of its (nonzero) digits is 800000, while the sum is 43.
Adding to 20455525124251 its reverse (15242152555402), we get a palindrome (35697677679653).
The spelling of 20455525124251 in words is "twenty trillion, four hundred fifty-five billion, five hundred twenty-five million, one hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •