Base | Representation |
---|---|
bin | 1001011101011001100011… |
… | …1010110001111101100000 |
3 | 1100211021222100220202222101 |
4 | 2113112120322301331200 |
5 | 2330401043412310230 |
6 | 34042001305220144 |
7 | 2122265402653165 |
oct | 227263072617540 |
9 | 40737870822871 |
10 | 10400681369440 |
11 | 334a9a454035a |
12 | 11bb87b191654 |
13 | 5a5a1a9b1c3b |
14 | 27d5779ba06c |
15 | 13082b57daca |
hex | 97598eb1f60 |
10400681369440 has 24 divisors (see below), whose sum is σ = 24571609735680. Its totient is φ = 4160272547712.
The previous prime is 10400681369417. The next prime is 10400681369453. The reversal of 10400681369440 is 4496318600401.
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 3 ways as a sum of consecutive naturals, for example, 32502129120 + ... + 32502129439.
It is an arithmetic number, because the mean of its divisors is an integer number (1023817072320).
Almost surely, 210400681369440 is an apocalyptic number.
10400681369440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10400681369440 is an abundant number, since it is smaller than the sum of its proper divisors (14170928366240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10400681369440 is an equidigital number, since it uses as much as digits as its factorization.
10400681369440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65004258574 (or 65004258566 counting only the distinct ones).
The product of its (nonzero) digits is 497664, while the sum is 46.
Adding to 10400681369440 its reverse (4496318600401), we get a palindrome (14896999969841).
The spelling of 10400681369440 in words is "ten trillion, four hundred billion, six hundred eighty-one million, three hundred sixty-nine thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •