Base | Representation |
---|---|
bin | 10011100100101100100… |
… | …000001110000101100101 |
3 | 11202120212100011011220121 |
4 | 103210230200032011211 |
5 | 134014201240014321 |
6 | 2505530044201541 |
7 | 166115060214565 |
oct | 23445440160545 |
9 | 4676770134817 |
10 | 1345071407461 |
11 | 47949481a771 |
12 | 1988258392b1 |
13 | 99abba4a902 |
14 | 4915d4c4da5 |
15 | 24ec5c6b441 |
hex | 1392c80e165 |
1345071407461 has 4 divisors (see below), whose sum is σ = 1345075588800. Its totient is φ = 1345067226124.
The previous prime is 1345071407447. The next prime is 1345071407473. The reversal of 1345071407461 is 1647041705431.
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 not a de Polignac number, because 1345071407461 - 25 = 1345071407429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345071407431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1563901 + ... + 2266258.
It is an arithmetic number, because the mean of its divisors is an integer number (336268897200).
Almost surely, 21345071407461 is an apocalyptic number.
It is an amenable number.
1345071407461 is a deficient number, since it is larger than the sum of its proper divisors (4181339).
1345071407461 is an equidigital number, since it uses as much as digits as its factorization.
1345071407461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4181338.
The product of its (nonzero) digits is 282240, while the sum is 43.
The spelling of 1345071407461 in words is "one trillion, three hundred forty-five billion, seventy-one million, four hundred seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •