Base | Representation |
---|---|
bin | 10011100110011101100… |
… | …101110010101001001001 |
3 | 11202202202120020021211021 |
4 | 103212131211302221021 |
5 | 134032042441141241 |
6 | 2510442221432441 |
7 | 166213065661336 |
oct | 23463545625111 |
9 | 4682676207737 |
10 | 1346968693321 |
11 | 47a278791709 |
12 | 19907510b721 |
13 | 9a031b40c74 |
14 | 4929d48398d |
15 | 250875e00d1 |
hex | 1399d972a49 |
1346968693321 has 4 divisors (see below), whose sum is σ = 1352090247552. Its totient is φ = 1341847139092.
The previous prime is 1346968693277. The next prime is 1346968693339. The reversal of 1346968693321 is 1233968696431.
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 1346968693321 - 223 = 1346960304713 is a prime.
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 1346968693321.
It is not an unprimeable number, because it can be changed into a prime (1346968693361) 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, 2560776721 + ... + 2560777246.
It is an arithmetic number, because the mean of its divisors is an integer number (338022561888).
Almost surely, 21346968693321 is an apocalyptic number.
It is an amenable number.
1346968693321 is a deficient number, since it is larger than the sum of its proper divisors (5121554231).
1346968693321 is an equidigital number, since it uses as much as digits as its factorization.
1346968693321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5121554230.
The product of its digits is 30233088, while the sum is 61.
The spelling of 1346968693321 in words is "one trillion, three hundred forty-six billion, nine hundred sixty-eight million, six hundred ninety-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •