Base | Representation |
---|---|
bin | 1001010010111001010001… |
… | …11100101101011101011110 |
3 | 2200101002100011012001121021 |
4 | 10221130220330231131132 |
5 | 10134344003202141100 |
6 | 111250112401554354 |
7 | 4206526032244204 |
oct | 451345074553536 |
9 | 80332304161537 |
10 | 20440436365150 |
11 | 65708164a102a |
12 | 23615b09459ba |
13 | b536a9209159 |
14 | 50947293b074 |
15 | 256a8170ea1a |
hex | 129728f2d75e |
20440436365150 has 12 divisors (see below), whose sum is σ = 38019211639272. Its totient is φ = 8176174546040.
The previous prime is 20440436365099. The next prime is 20440436365157. The reversal of 20440436365150 is 5156363404402.
It is a happy number.
It is a super-2 number, since 2×204404363651502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20440436365097 and 20440436365106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20440436365157) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 204404363602 + ... + 204404363701.
It is an arithmetic number, because the mean of its divisors is an integer number (3168267636606).
Almost surely, 220440436365150 is an apocalyptic number.
20440436365150 is a deficient number, since it is larger than the sum of its proper divisors (17578775274122).
20440436365150 is a wasteful number, since it uses less digits than its factorization.
20440436365150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408808727315 (or 408808727310 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 43.
Adding to 20440436365150 its reverse (5156363404402), we get a palindrome (25596799769552).
The spelling of 20440436365150 in words is "twenty trillion, four hundred forty billion, four hundred thirty-six million, three hundred sixty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •