Base | Representation |
---|---|
bin | 1001111101101001001010… |
… | …0100011110000001010000 |
3 | 1102210020210200210021210021 |
4 | 2133122102210132001100 |
5 | 2413440033130412410 |
6 | 35144252513313224 |
7 | 2210305556365126 |
oct | 237322244360120 |
9 | 42706720707707 |
10 | 10954625638480 |
11 | 354391564a587 |
12 | 128b0b5b65814 |
13 | 61602aaaa324 |
14 | 29c2c72d7916 |
15 | 13ee4ce6deda |
hex | 9f69291e050 |
10954625638480 has 40 divisors (see below), whose sum is σ = 26967710766312. Its totient is φ = 4124094357504.
The previous prime is 10954625638471. The next prime is 10954625638529. The reversal of 10954625638480 is 8483652645901.
It can be written as a sum of positive squares in 4 ways, for example, as 80433497664 + 10874192140816 = 283608^2 + 3297604^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4027434537 + ... + 4027437256.
Almost surely, 210954625638480 is an apocalyptic number.
10954625638480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10954625638480 is an abundant number, since it is smaller than the sum of its proper divisors (16013085127832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10954625638480 is a wasteful number, since it uses less digits than its factorization.
10954625638480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8054871823 (or 8054871817 counting only the distinct ones).
The product of its (nonzero) digits is 49766400, while the sum is 61.
The spelling of 10954625638480 in words is "ten trillion, nine hundred fifty-four billion, six hundred twenty-five million, six hundred thirty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.420 sec. • engine limits •