Base | Representation |
---|---|
bin | 1001011111101110000111… |
… | …1101011101101111110111 |
3 | 1100222002220200110002210110 |
4 | 2113323201331131233313 |
5 | 2332024232221444021 |
6 | 34112154443154103 |
7 | 2125206563421501 |
oct | 227734175355767 |
9 | 40862820402713 |
10 | 10440561515511 |
11 | 33658a9877366 |
12 | 120754ab15933 |
13 | 5a9704c8bbca |
14 | 28147c2a8d71 |
15 | 1318b278d476 |
hex | 97ee1f5dbf7 |
10440561515511 has 64 divisors (see below), whose sum is σ = 15182396006400. Its totient is φ = 6356669031936.
The previous prime is 10440561515497. The next prime is 10440561515533. The reversal of 10440561515511 is 11551516504401.
It is not a de Polignac number, because 10440561515511 - 231 = 10438414031863 is a prime.
It is a super-2 number, since 2×104405615155112 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10440561515511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10440561515551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 246201036 + ... + 246243438.
It is an arithmetic number, because the mean of its divisors is an integer number (237224937600).
Almost surely, 210440561515511 is an apocalyptic number.
10440561515511 is a deficient number, since it is larger than the sum of its proper divisors (4741834490889).
10440561515511 is a wasteful number, since it uses less digits than its factorization.
10440561515511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43348.
The product of its (nonzero) digits is 60000, while the sum is 39.
The spelling of 10440561515511 in words is "ten trillion, four hundred forty billion, five hundred sixty-one million, five hundred fifteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •