Base | Representation |
---|---|
bin | 10011001000111111010… |
… | …100000000011110101111 |
3 | 11122202002001202222000021 |
4 | 103020333110000132233 |
5 | 133022234440431111 |
6 | 2444130051343011 |
7 | 164012624150335 |
oct | 23107724003657 |
9 | 4582061688007 |
10 | 1315322202031 |
11 | 467909102382 |
12 | 192b028b1a67 |
13 | 9705a615a86 |
14 | 4793a4c1b55 |
15 | 24334181d71 |
hex | 1323f5007af |
1315322202031 has 12 divisors (see below), whose sum is σ = 1331778771792. Its totient is φ = 1298967186048.
The previous prime is 1315322202013. The next prime is 1315322202041. The reversal of 1315322202031 is 1302022235131.
It is not a de Polignac number, because 1315322202031 - 213 = 1315322193839 is a prime.
It is a super-2 number, since 2×13153222020312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1315322201987 and 1315322202005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1315322202001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8594526 + ... + 8746228.
It is an arithmetic number, because the mean of its divisors is an integer number (110981564316).
Almost surely, 21315322202031 is an apocalyptic number.
1315322202031 is a deficient number, since it is larger than the sum of its proper divisors (16456569761).
1315322202031 is an equidigital number, since it uses as much as digits as its factorization.
1315322202031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152370 (or 152093 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 1315322202031 its reverse (1302022235131), we get a palindrome (2617344437162).
The spelling of 1315322202031 in words is "one trillion, three hundred fifteen billion, three hundred twenty-two million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •