Base | Representation |
---|---|
bin | 10011100111110100110… |
… | …101010110110010111101 |
3 | 11202220112120102212001122 |
4 | 103213310311112302331 |
5 | 134043042143010412 |
6 | 2511243345520325 |
7 | 166264261132502 |
oct | 23476465266275 |
9 | 4686476385048 |
10 | 1348432391357 |
11 | 47a959a27707 |
12 | 1994033430a5 |
13 | 9a20616298c |
14 | 4939ba174a9 |
15 | 25120d68572 |
hex | 139f4d56cbd |
1348432391357 has 4 divisors (see below), whose sum is σ = 1348454349120. Its totient is φ = 1348410433596.
The previous prime is 1348432391309. The next prime is 1348432391363. The reversal of 1348432391357 is 7531932348431.
It is a happy number.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1348432391357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1348432391299 and 1348432391308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1348432391057) 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, 10886507 + ... + 11009672.
It is an arithmetic number, because the mean of its divisors is an integer number (337113587280).
Almost surely, 21348432391357 is an apocalyptic number.
It is an amenable number.
1348432391357 is a deficient number, since it is larger than the sum of its proper divisors (21957763).
1348432391357 is an equidigital number, since it uses as much as digits as its factorization.
1348432391357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21957762.
The product of its digits is 6531840, while the sum is 53.
The spelling of 1348432391357 in words is "one trillion, three hundred forty-eight billion, four hundred thirty-two million, three hundred ninety-one thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •