Base | Representation |
---|---|
bin | 1010010111110011001101… |
… | …1100010110100101001111 |
3 | 1111101012201110021011200000 |
4 | 2211330303130112211033 |
5 | 2443320343304211143 |
6 | 40130531552135343 |
7 | 2254624532111250 |
oct | 245746334264517 |
9 | 44335643234600 |
10 | 11404001241423 |
11 | 36a74564431aa |
12 | 1342208b37553 |
13 | 6495149c9b6b |
14 | 2b5d56cd2b27 |
15 | 14b99e4c0bd3 |
hex | a5f3371694f |
11404001241423 has 24 divisors (see below), whose sum is σ = 19522899247488. Its totient is φ = 6516572136984.
The previous prime is 11404001241371. The next prime is 11404001241433. The reversal of 11404001241423 is 32414210040411.
11404001241423 is a `hidden beast` number, since 1 + 14 + 0 + 400 + 1 + 241 + 4 + 2 + 3 = 666.
It is not a de Polignac number, because 11404001241423 - 230 = 11402927499599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11404001241433) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3352144461 + ... + 3352147862.
It is an arithmetic number, because the mean of its divisors is an integer number (813454135312).
Almost surely, 211404001241423 is an apocalyptic number.
11404001241423 is a deficient number, since it is larger than the sum of its proper divisors (8118898006065).
11404001241423 is an frugal number, since it uses more digits than its factorization.
11404001241423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6704292345 (or 6704292333 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 11404001241423 its reverse (32414210040411), we get a palindrome (43818211281834).
The spelling of 11404001241423 in words is "eleven trillion, four hundred four billion, one million, two hundred forty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •