Base | Representation |
---|---|
bin | 1010011010100010110110… |
… | …0001101001001111011001 |
3 | 1111112201102002120211000112 |
4 | 2212220231201221033121 |
5 | 3000103422012334104 |
6 | 40204330101014105 |
7 | 2261214042102341 |
oct | 246505541511731 |
9 | 44481362524015 |
10 | 11451146605529 |
11 | 3715449801034 |
12 | 134b3859b4335 |
13 | 650ab9220107 |
14 | 2b834a459d21 |
15 | 14cd0d43786e |
hex | a6a2d8693d9 |
11451146605529 has 16 divisors (see below), whose sum is σ = 11493236009472. Its totient is φ = 11409143061888.
The previous prime is 11451146605517. The next prime is 11451146605583. The reversal of 11451146605529 is 92550664115411.
11451146605529 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11451146605529 - 220 = 11451145556953 is a prime.
It is a super-2 number, since 2×114511466055292 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11451146607529) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1008639317 + ... + 1008650669.
It is an arithmetic number, because the mean of its divisors is an integer number (718327250592).
Almost surely, 211451146605529 is an apocalyptic number.
It is an amenable number.
11451146605529 is a deficient number, since it is larger than the sum of its proper divisors (42089403943).
11451146605529 is a wasteful number, since it uses less digits than its factorization.
11451146605529 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14816.
The product of its (nonzero) digits is 1296000, while the sum is 50.
The spelling of 11451146605529 in words is "eleven trillion, four hundred fifty-one billion, one hundred forty-six million, six hundred five thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •