Base | Representation |
---|---|
bin | 10011000110000101110… |
… | …101100000110101101001 |
3 | 11122110001012102012212102 |
4 | 103012011311200311221 |
5 | 132444401332020040 |
6 | 2442453211223145 |
7 | 163542540363566 |
oct | 23060565406551 |
9 | 4573035365772 |
10 | 1312210423145 |
11 | 466561635896 |
12 | 192394747ab5 |
13 | 96982a255ab |
14 | 477230dd86d |
15 | 24200dad515 |
hex | 13185d60d69 |
1312210423145 has 8 divisors (see below), whose sum is σ = 1574660005056. Its totient is φ = 1049763340336.
The previous prime is 1312210423109. The next prime is 1312210423213. The reversal of 1312210423145 is 5413240122131.
It is a happy number.
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 1312210423145 - 238 = 1037332516201 is a prime.
It is a super-2 number, since 2×13122104231452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 844514 + ... + 1826916.
It is an arithmetic number, because the mean of its divisors is an integer number (196832500632).
Almost surely, 21312210423145 is an apocalyptic number.
It is an amenable number.
1312210423145 is a deficient number, since it is larger than the sum of its proper divisors (262449581911).
1312210423145 is an equidigital number, since it uses as much as digits as its factorization.
1312210423145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1249551.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 1312210423145 its reverse (5413240122131), we get a palindrome (6725450545276).
The spelling of 1312210423145 in words is "one trillion, three hundred twelve billion, two hundred ten million, four hundred twenty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •