Base | Representation |
---|---|
bin | 1010100000000000101001… |
… | …0001010110101110100111 |
3 | 1111212200202222212200021112 |
4 | 2220000022101112232213 |
5 | 3003123222332211401 |
6 | 40315415320535235 |
7 | 2301046651230161 |
oct | 250001221265647 |
9 | 44780688780245 |
10 | 11545044413351 |
11 | 37512536578a9 |
12 | 136561002151b |
13 | 659901733547 |
14 | 2bcad6ca9931 |
15 | 1504a6aa03bb |
hex | a800a456ba7 |
11545044413351 has 8 divisors (see below), whose sum is σ = 11764699207344. Its totient is φ = 11325457166400.
The previous prime is 11545044413333. The next prime is 11545044413363. The reversal of 11545044413351 is 15331444054511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11545044413351 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11545044413299 and 11545044413308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11545044413381) 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, 16541606 + ... + 17225411.
It is an arithmetic number, because the mean of its divisors is an integer number (1470587400918).
Almost surely, 211545044413351 is an apocalyptic number.
11545044413351 is a deficient number, since it is larger than the sum of its proper divisors (219654793993).
11545044413351 is an equidigital number, since it uses as much as digits as its factorization.
11545044413351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33773521.
The product of its (nonzero) digits is 288000, while the sum is 41.
Adding to 11545044413351 its reverse (15331444054511), we get a palindrome (26876488467862).
The spelling of 11545044413351 in words is "eleven trillion, five hundred forty-five billion, forty-four million, four hundred thirteen thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •