Base | Representation |
---|---|
bin | 10011000101100011010… |
… | …000111010010111100101 |
3 | 11122101112210000010212111 |
4 | 103011203100322113211 |
5 | 132442204340344140 |
6 | 2442315451321021 |
7 | 163522265321104 |
oct | 23054320722745 |
9 | 4571483003774 |
10 | 1311630403045 |
11 | 466294194136 |
12 | 192252450171 |
13 | 968bc803c31 |
14 | 476aa07803b |
15 | 241b9eda7ea |
hex | 1316343a5e5 |
1311630403045 has 4 divisors (see below), whose sum is σ = 1573956483660. Its totient is φ = 1049304322432.
The previous prime is 1311630403037. The next prime is 1311630403063. The reversal of 1311630403045 is 5403040361131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 258098545156 + 1053531857889 = 508034^2 + 1026417^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311630403045 - 23 = 1311630403037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311630402998 and 1311630403016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131163040300 + ... + 131163040309.
It is an arithmetic number, because the mean of its divisors is an integer number (393489120915).
Almost surely, 21311630403045 is an apocalyptic number.
It is an amenable number.
1311630403045 is a deficient number, since it is larger than the sum of its proper divisors (262326080615).
1311630403045 is an equidigital number, since it uses as much as digits as its factorization.
1311630403045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262326080614.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 1311630403045 its reverse (5403040361131), we get a palindrome (6714670764176).
The spelling of 1311630403045 in words is "one trillion, three hundred eleven billion, six hundred thirty million, four hundred three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •