Base | Representation |
---|---|
bin | 1010010010100000101110… |
… | …1100101100011100011101 |
3 | 1111001112012012001010201100 |
4 | 2210220023230230130131 |
5 | 2440323302332422141 |
6 | 40021103531103313 |
7 | 2245230105256503 |
oct | 244501354543435 |
9 | 44045165033640 |
10 | 11313140123421 |
11 | 367196a737444 |
12 | 132868b8a1b39 |
13 | 640a94675c06 |
14 | 2b17b78ba673 |
15 | 1494327480b6 |
hex | a4a0bb2c71d |
11313140123421 has 24 divisors (see below), whose sum is σ = 16694936183744. Its totient is φ = 7380322646400.
The previous prime is 11313140123401. The next prime is 11313140123437. The reversal of 11313140123421 is 12432104131311.
11313140123421 is a `hidden beast` number, since 1 + 1 + 3 + 1 + 3 + 1 + 401 + 234 + 21 = 666.
It is not a de Polignac number, because 11313140123421 - 215 = 11313140090653 is a prime.
It is a super-2 number, since 2×113131401234212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313140123401) 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, 62032876 + ... + 62214981.
Almost surely, 211313140123421 is an apocalyptic number.
It is an amenable number.
11313140123421 is a deficient number, since it is larger than the sum of its proper divisors (5381796060323).
11313140123421 is a wasteful number, since it uses less digits than its factorization.
11313140123421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124248081 (or 124248078 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 11313140123421 its reverse (12432104131311), we get a palindrome (23745244254732).
The spelling of 11313140123421 in words is "eleven trillion, three hundred thirteen billion, one hundred forty million, one hundred twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •