Base | Representation |
---|---|
bin | 10011100001110111010… |
… | …110111101000101011111 |
3 | 11202022000112112122120001 |
4 | 103201313112331011133 |
5 | 133441440232134211 |
6 | 2504304321435131 |
7 | 165646545232222 |
oct | 23416726750537 |
9 | 4668015478501 |
10 | 1342032302431 |
11 | 478175280117 |
12 | 198117a9baa7 |
13 | 99726224002 |
14 | 48d51a1d5b9 |
15 | 24d99050ac1 |
hex | 138775bd15f |
1342032302431 has 4 divisors (see below), whose sum is σ = 1342251130072. Its totient is φ = 1341813474792.
The previous prime is 1342032302419. The next prime is 1342032302437.
It is a happy number.
1342032302431 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1342032302431 - 25 = 1342032302399 is a prime.
It is a super-2 number, since 2×13420323024312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1342032302431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1342032302437) 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, 109404621 + ... + 109416886.
It is an arithmetic number, because the mean of its divisors is an integer number (335562782518).
Almost surely, 21342032302431 is an apocalyptic number.
1342032302431 is a deficient number, since it is larger than the sum of its proper divisors (218827641).
1342032302431 is an equidigital number, since it uses as much as digits as its factorization.
1342032302431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218827640.
The product of its (nonzero) digits is 10368, while the sum is 28.
The spelling of 1342032302431 in words is "one trillion, three hundred forty-two billion, thirty-two million, three hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •