Base | Representation |
---|---|
bin | 1001011101110001110100… |
… | …0111001000001101111100 |
3 | 1100211220210020220010110222 |
4 | 2113130131013020031330 |
5 | 2331002413201304030 |
6 | 34044555441120512 |
7 | 2122615654553522 |
oct | 227343507101574 |
9 | 40756706803428 |
10 | 10407194166140 |
11 | 3352736878972 |
12 | 1200b98329138 |
13 | 5a65180935b5 |
14 | 27d9d4952312 |
15 | 130aad20b3e5 |
hex | 9771d1c837c |
10407194166140 has 24 divisors (see below), whose sum is σ = 22225533306480. Its totient is φ = 4092320417408.
The previous prime is 10407194166113. The next prime is 10407194166157. The reversal of 10407194166140 is 4166149170401.
It is a junction number, because it is equal to n+sod(n) for n = 10407194166091 and 10407194166100.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4409826857 + ... + 4409829216.
It is an arithmetic number, because the mean of its divisors is an integer number (926063887770).
Almost surely, 210407194166140 is an apocalyptic number.
10407194166140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10407194166140 is an abundant number, since it is smaller than the sum of its proper divisors (11818339140340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10407194166140 is a wasteful number, since it uses less digits than its factorization.
10407194166140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8819656141 (or 8819656139 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 44.
The spelling of 10407194166140 in words is "ten trillion, four hundred seven billion, one hundred ninety-four million, one hundred sixty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •