Base | Representation |
---|---|
bin | 101000000111011… |
… | …0110010111010001 |
3 | 10110210212102212022 |
4 | 1100032312113101 |
5 | 10224043214334 |
6 | 341322541225 |
7 | 45233256146 |
oct | 12016662721 |
9 | 3423772768 |
10 | 1346069969 |
11 | 630904322 |
12 | 316967815 |
13 | 185b4860a |
14 | caab43cd |
15 | 7d29082e |
hex | 503b65d1 |
1346069969 has 4 divisors (see below), whose sum is σ = 1349584896. Its totient is φ = 1342555044.
The previous prime is 1346069957. The next prime is 1346069971. The reversal of 1346069969 is 9699606431.
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-1346069969 is a prime.
It is a super-2 number, since 2×13460699692 = 3623808722887321922, 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 1346069969.
It is not an unprimeable number, because it can be changed into a prime (1346069929) 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, 1756889 + ... + 1757654.
It is an arithmetic number, because the mean of its divisors is an integer number (337396224).
Almost surely, 21346069969 is an apocalyptic number.
It is an amenable number.
1346069969 is a deficient number, since it is larger than the sum of its proper divisors (3514927).
1346069969 is an equidigital number, since it uses as much as digits as its factorization.
1346069969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3514926.
The product of its (nonzero) digits is 1889568, while the sum is 53.
The square root of 1346069969 is about 36688.8262145302. The cubic root of 1346069969 is about 1104.1359362409.
The spelling of 1346069969 in words is "one billion, three hundred forty-six million, sixty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •