Base | Representation |
---|---|
bin | 1001011101011100101010… |
… | …0111011000100101010000 |
3 | 1100211101010110210222210010 |
4 | 2113113022213120211100 |
5 | 2330404300334124202 |
6 | 34042220132034520 |
7 | 2122325145643266 |
oct | 227271247304520 |
9 | 40741113728703 |
10 | 10401515145552 |
11 | 3350292150723 |
12 | 11bba72462a40 |
13 | 5a5b2165c79b |
14 | 27d616618436 |
15 | 13087987876c |
hex | 975ca9d8950 |
10401515145552 has 40 divisors (see below), whose sum is σ = 26931789459520. Its totient is φ = 3459273822720.
The previous prime is 10401515145533. The next prime is 10401515145569. The reversal of 10401515145552 is 25554151510401.
It is a self number, because there is not a number n which added to its sum of digits gives 10401515145552.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 246787849 + ... + 246829992.
It is an arithmetic number, because the mean of its divisors is an integer number (673294736488).
Almost surely, 210401515145552 is an apocalyptic number.
10401515145552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10401515145552 is an abundant number, since it is smaller than the sum of its proper divisors (16530274313968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10401515145552 is a wasteful number, since it uses less digits than its factorization.
10401515145552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493618291 (or 493618285 counting only the distinct ones).
The product of its (nonzero) digits is 100000, while the sum is 39.
Adding to 10401515145552 its reverse (25554151510401), we get a palindrome (35955666655953).
The spelling of 10401515145552 in words is "ten trillion, four hundred one billion, five hundred fifteen million, one hundred forty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •