Base | Representation |
---|---|
bin | 1110000111001011101010… |
… | …00010100010001101101101 |
3 | 11001212201212020221212202212 |
4 | 13003211311002202031231 |
5 | 13031421243142443201 |
6 | 150000224351100205 |
7 | 6352032130222325 |
oct | 703456502421555 |
9 | 131781766855685 |
10 | 31033102312301 |
11 | 9985079251141 |
12 | 359250b211665 |
13 | 144154172751b |
14 | 79401dc78285 |
15 | 38c3976bcabb |
hex | 1c39750a236d |
31033102312301 has 2 divisors, whose sum is σ = 31033102312302. Its totient is φ = 31033102312300.
The previous prime is 31033102312273. The next prime is 31033102312307. The reversal of 31033102312301 is 10321320133013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17580536197225 + 13452566115076 = 4192915^2 + 3667774^2 .
It is an emirp because it is prime and its reverse (10321320133013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31033102312301 - 26 = 31033102312237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31033102312307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15516551156150 + 15516551156151.
It is an arithmetic number, because the mean of its divisors is an integer number (15516551156151).
Almost surely, 231033102312301 is an apocalyptic number.
It is an amenable number.
31033102312301 is a deficient number, since it is larger than the sum of its proper divisors (1).
31033102312301 is an equidigital number, since it uses as much as digits as its factorization.
31033102312301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 31033102312301 its reverse (10321320133013), we get a palindrome (41354422445314).
The spelling of 31033102312301 in words is "thirty-one trillion, thirty-three billion, one hundred two million, three hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •