Base | Representation |
---|---|
bin | 1010011010100010110100… |
… | …1000100110011011011010 |
3 | 1111112201101122020021100222 |
4 | 2212220231020212123122 |
5 | 3000103413322243120 |
6 | 40204325304200042 |
7 | 2261213632230140 |
oct | 246505510463332 |
9 | 44481348207328 |
10 | 11451140040410 |
11 | 3715446027614 |
12 | 134b383769022 |
13 | 650ab7a61b25 |
14 | 2b834962b590 |
15 | 14cd0ca8c525 |
hex | a6a2d2266da |
11451140040410 has 16 divisors (see below), whose sum is σ = 23556630940416. Its totient is φ = 3926105156688.
The previous prime is 11451140040409. The next prime is 11451140040419. The reversal of 11451140040410 is 1404004115411.
It is a happy number.
It is a super-2 number, since 2×114511400404102 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11451140040410.
It is not an unprimeable number, because it can be changed into a prime (11451140040419) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81793857362 + ... + 81793857501.
It is an arithmetic number, because the mean of its divisors is an integer number (1472289433776).
Almost surely, 211451140040410 is an apocalyptic number.
11451140040410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11451140040410 is an abundant number, since it is smaller than the sum of its proper divisors (12105490900006).
11451140040410 is a wasteful number, since it uses less digits than its factorization.
11451140040410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163587714877.
The product of its (nonzero) digits is 1280, while the sum is 26.
Adding to 11451140040410 its reverse (1404004115411), we get a palindrome (12855144155821).
The spelling of 11451140040410 in words is "eleven trillion, four hundred fifty-one billion, one hundred forty million, forty thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •