Base | Representation |
---|---|
bin | 10011100000010111010… |
… | …101110110011010100111 |
3 | 11202010212021100100011121 |
4 | 103200113111312122213 |
5 | 133430140334301411 |
6 | 2503440414314411 |
7 | 165561614624314 |
oct | 23402725663247 |
9 | 4663767310147 |
10 | 1340421400231 |
11 | 477518a32491 |
12 | 1979484b8a07 |
13 | 9952a571b44 |
14 | 48c3bacbd0b |
15 | 24d028eb571 |
hex | 138175766a7 |
1340421400231 has 24 divisors (see below), whose sum is σ = 1424640223104. Its totient is φ = 1260964013760.
The previous prime is 1340421400189. The next prime is 1340421400243. The reversal of 1340421400231 is 1320041240431.
It is not a de Polignac number, because 1340421400231 - 29 = 1340421399719 is a prime.
It is a super-2 number, since 2×13404214002312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1340421400196 and 1340421400205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340421800231) 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, 31938721 + ... + 31980661.
It is an arithmetic number, because the mean of its divisors is an integer number (59360009296).
Almost surely, 21340421400231 is an apocalyptic number.
1340421400231 is a deficient number, since it is larger than the sum of its proper divisors (84218822873).
1340421400231 is a wasteful number, since it uses less digits than its factorization.
1340421400231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42599 (or 42580 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1340421400231 its reverse (1320041240431), we get a palindrome (2660462640662).
The spelling of 1340421400231 in words is "one trillion, three hundred forty billion, four hundred twenty-one million, four hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •