Base | Representation |
---|---|
bin | 1110000111000110000100… |
… | …01110011111000001100101 |
3 | 11001212110010011221122112011 |
4 | 13003203002032133001211 |
5 | 13031344122143321201 |
6 | 145555010542554221 |
7 | 6351564601563604 |
oct | 703430216370145 |
9 | 131773104848464 |
10 | 31030102323301 |
11 | 9983879898a94 |
12 | 3591a12598971 |
13 | 1441184047cc3 |
14 | 793c17675a3b |
15 | 38c26e12c151 |
hex | 1c38c239f065 |
31030102323301 has 4 divisors (see below), whose sum is σ = 31030896397600. Its totient is φ = 31029308249004.
The previous prime is 31030102323133. The next prime is 31030102323331. The reversal of 31030102323301 is 10332320103013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31030102323301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31030102323331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 396978531 + ... + 397056688.
It is an arithmetic number, because the mean of its divisors is an integer number (7757724099400).
Almost surely, 231030102323301 is an apocalyptic number.
It is an amenable number.
31030102323301 is a deficient number, since it is larger than the sum of its proper divisors (794074299).
31030102323301 is an equidigital number, since it uses as much as digits as its factorization.
31030102323301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 794074298.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 31030102323301 its reverse (10332320103013), we get a palindrome (41362422426314).
The spelling of 31030102323301 in words is "thirty-one trillion, thirty billion, one hundred two million, three hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •