Base | Representation |
---|---|
bin | 1010100000011110011100… |
… | …0110111001110010011001 |
3 | 1111220110102112021101021101 |
4 | 2220013213012321302121 |
5 | 3003241113331433101 |
6 | 40323221220311401 |
7 | 2301452132105152 |
oct | 250074706716231 |
9 | 44813375241241 |
10 | 11553044405401 |
11 | 375468941a284 |
12 | 1367083242561 |
13 | 65a5a7c72b55 |
14 | 2bd255570929 |
15 | 1507c4098401 |
hex | a81e71b9c99 |
11553044405401 has 4 divisors (see below), whose sum is σ = 11561302480000. Its totient is φ = 11544786330804.
The previous prime is 11553044405381. The next prime is 11553044405407. The reversal of 11553044405401 is 10450444035511.
11553044405401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11553044405401 - 211 = 11553044403353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11553044405407) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4129035201 + ... + 4129037998.
It is an arithmetic number, because the mean of its divisors is an integer number (2890325620000).
Almost surely, 211553044405401 is an apocalyptic number.
It is an amenable number.
11553044405401 is a deficient number, since it is larger than the sum of its proper divisors (8258074599).
11553044405401 is an equidigital number, since it uses as much as digits as its factorization.
11553044405401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8258074598.
The product of its (nonzero) digits is 96000, while the sum is 37.
The spelling of 11553044405401 in words is "eleven trillion, five hundred fifty-three billion, forty-four million, four hundred five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •