Base | Representation |
---|---|
bin | 10010111101101101100… |
… | …011011101011110110111 |
3 | 11121120211011100222222010 |
4 | 102331231203131132313 |
5 | 132322440023244111 |
6 | 2434404323335303 |
7 | 163103556413610 |
oct | 22755543353667 |
9 | 4546734328863 |
10 | 1303213103031 |
11 | 462764905044 |
12 | 1906a3521533 |
13 | 95b7a9a3038 |
14 | 4710c1c4c07 |
15 | 23d76060aa6 |
hex | 12f6d8dd7b7 |
1303213103031 has 16 divisors (see below), whose sum is σ = 1988215488000. Its totient is φ = 743805595488.
The previous prime is 1303213102991. The next prime is 1303213103033. The reversal of 1303213103031 is 1303013123031.
It is not a de Polignac number, because 1303213103031 - 211 = 1303213100983 is a prime.
It is a super-2 number, since 2×13032131030312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1303213102989 and 1303213103007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303213103033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36965556 + ... + 37000793.
It is an arithmetic number, because the mean of its divisors is an integer number (124263468000).
Almost surely, 21303213103031 is an apocalyptic number.
1303213103031 is a deficient number, since it is larger than the sum of its proper divisors (685002384969).
1303213103031 is an equidigital number, since it uses as much as digits as its factorization.
1303213103031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73967198.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1303213103031 its reverse (1303013123031), we get a palindrome (2606226226062).
The spelling of 1303213103031 in words is "one trillion, three hundred three billion, two hundred thirteen million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •