Base | Representation |
---|---|
bin | 101000000111000… |
… | …1110000001000011 |
3 | 10110210120001011111 |
4 | 1100032032001003 |
5 | 10224022422312 |
6 | 341315224151 |
7 | 45232000300 |
oct | 12016160103 |
9 | 3423501144 |
10 | 1345904707 |
11 | 630801144 |
12 | 3168a8057 |
13 | 185abb324 |
14 | caa700a7 |
15 | 7d25b8a7 |
hex | 5038e043 |
1345904707 has 6 divisors (see below), whose sum is σ = 1565644308. Its totient is φ = 1153632564.
The previous prime is 1345904629. The next prime is 1345904717. The reversal of 1345904707 is 7074095431.
It is not a de Polignac number, because 1345904707 - 215 = 1345871939 is a prime.
It is a super-2 number, since 2×13459047072 = 3622918960649511698, which 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 1345904707.
It is not an unprimeable number, because it can be changed into a prime (1345904717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13733673 + ... + 13733770.
It is an arithmetic number, because the mean of its divisors is an integer number (260940718).
Almost surely, 21345904707 is an apocalyptic number.
1345904707 is a deficient number, since it is larger than the sum of its proper divisors (219739601).
1345904707 is an equidigital number, since it uses as much as digits as its factorization.
1345904707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27467457 (or 27467450 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 40.
The square root of 1345904707 is about 36686.5739337976. The cubic root of 1345904707 is about 1104.0907481042.
The spelling of 1345904707 in words is "one billion, three hundred forty-five million, nine hundred four thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •