Base | Representation |
---|---|
bin | 10011100000010111111… |
… | …010111001100011010001 |
3 | 11202010212221121202202121 |
4 | 103200113322321203101 |
5 | 133430200331044101 |
6 | 2503441402414241 |
7 | 165562063314553 |
oct | 23402772714321 |
9 | 4663787552677 |
10 | 1340431112401 |
11 | 477523466377 |
12 | 19794b801381 |
13 | 9952c5926a4 |
14 | 48c3d0d94d3 |
15 | 24d036b90a1 |
hex | 13817eb98d1 |
1340431112401 has 4 divisors (see below), whose sum is σ = 1340433432304. Its totient is φ = 1340428792500.
The previous prime is 1340431112399. The next prime is 1340431112407. The reversal of 1340431112401 is 1042111340431.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1340431112401 - 21 = 1340431112399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1340431112407) 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, 473326 + ... + 1704376.
It is an arithmetic number, because the mean of its divisors is an integer number (335108358076).
Almost surely, 21340431112401 is an apocalyptic number.
It is an amenable number.
1340431112401 is a deficient number, since it is larger than the sum of its proper divisors (2319903).
1340431112401 is a wasteful number, since it uses less digits than its factorization.
1340431112401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2319902.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1340431112401 its reverse (1042111340431), we get a palindrome (2382542452832).
The spelling of 1340431112401 in words is "one trillion, three hundred forty billion, four hundred thirty-one million, one hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •