Base | Representation |
---|---|
bin | 1110000111001011101010… |
… | …00001011000011101011011 |
3 | 11001212201212020101112101001 |
4 | 13003211311001120131123 |
5 | 13031421243103311303 |
6 | 150000224340405431 |
7 | 6352032124523506 |
oct | 703456501303533 |
9 | 131781766345331 |
10 | 31033102010203 |
11 | 9985079065177 |
12 | 359250b0a6877 |
13 | 144154164cb77 |
14 | 79401dbda13d |
15 | 38c39765d31d |
hex | 1c397505875b |
31033102010203 has 2 divisors, whose sum is σ = 31033102010204. Its totient is φ = 31033102010202.
The previous prime is 31033102010179. The next prime is 31033102010219. The reversal of 31033102010203 is 30201020133013.
It is a strong prime.
It is an emirp because it is prime and its reverse (30201020133013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31033102010203 - 233 = 31024512075611 is a prime.
It is a super-2 number, since 2×310331020102032 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31033102010503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15516551005101 + 15516551005102.
It is an arithmetic number, because the mean of its divisors is an integer number (15516551005102).
Almost surely, 231033102010203 is an apocalyptic number.
31033102010203 is a deficient number, since it is larger than the sum of its proper divisors (1).
31033102010203 is an equidigital number, since it uses as much as digits as its factorization.
31033102010203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 31033102010203 its reverse (30201020133013), we get a palindrome (61234122143216).
The spelling of 31033102010203 in words is "thirty-one trillion, thirty-three billion, one hundred two million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •