Base | Representation |
---|---|
bin | 10011000111011001111… |
… | …111011111000010010001 |
3 | 11122120200121011011211102 |
4 | 103013121333133002101 |
5 | 133010244303321340 |
6 | 2443245245154145 |
7 | 163622533341653 |
oct | 23073177370221 |
9 | 4576617134742 |
10 | 1313622323345 |
11 | 467116612362 |
12 | 19270955b955 |
13 | 96b493ac7b7 |
14 | 4781882c6d3 |
15 | 24284d04215 |
hex | 131d9fdf091 |
1313622323345 has 8 divisors (see below), whose sum is σ = 1609886081664. Its totient is φ = 1028538329584.
The previous prime is 1313622323333. The next prime is 1313622323353. The reversal of 1313622323345 is 5433232263131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1313622323345 - 212 = 1313622319249 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1313622323299 and 1313622323308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2794940879 + ... + 2794941348.
It is an arithmetic number, because the mean of its divisors is an integer number (201235760208).
Almost surely, 21313622323345 is an apocalyptic number.
It is an amenable number.
1313622323345 is a deficient number, since it is larger than the sum of its proper divisors (296263758319).
1313622323345 is an equidigital number, since it uses as much as digits as its factorization.
1313622323345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5589882279.
The product of its digits is 233280, while the sum is 38.
Adding to 1313622323345 its reverse (5433232263131), we get a palindrome (6746854586476).
The spelling of 1313622323345 in words is "one trillion, three hundred thirteen billion, six hundred twenty-two million, three hundred twenty-three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •