Base | Representation |
---|---|
bin | 1001101011100000101100… |
… | …0101110111010011101100 |
3 | 1101200110201222122120202202 |
4 | 2122320023011313103230 |
5 | 2343334044422433444 |
6 | 34345213552241032 |
7 | 2145640212135251 |
oct | 232701305672354 |
9 | 41613658576682 |
10 | 10643115046124 |
11 | 34337a0a83940 |
12 | 123a859840178 |
13 | 5c2845330932 |
14 | 28b1b5573428 |
15 | 136cb9eb434e |
hex | 9ae0b1774ec |
10643115046124 has 48 divisors (see below), whose sum is σ = 21628393718400. Its totient is φ = 4531663382400.
The previous prime is 10643115046121. The next prime is 10643115046159. The reversal of 10643115046124 is 42164051134601.
It is a super-2 number, since 2×106431150461242 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is not an unprimeable number, because it can be changed into a prime (10643115046121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71448062 + ... + 71596869.
It is an arithmetic number, because the mean of its divisors is an integer number (450591535800).
Almost surely, 210643115046124 is an apocalyptic number.
It is an amenable number.
10643115046124 is an abundant number, since it is smaller than the sum of its proper divisors (10985278672276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643115046124 is a wasteful number, since it uses less digits than its factorization.
10643115046124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143045054 (or 143045052 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 10643115046124 in words is "ten trillion, six hundred forty-three billion, one hundred fifteen million, forty-six thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •