Base | Representation |
---|---|
bin | 1110000111001011101100… |
… | …01010101010101011010010 |
3 | 11001212201220120112120002021 |
4 | 13003211312022222223102 |
5 | 13031421313013040310 |
6 | 150000230304242054 |
7 | 6352032450025564 |
oct | 703456612525322 |
9 | 131781816476067 |
10 | 31033121221330 |
11 | 9985088996838 |
12 | 359251561032a |
13 | 14415456181b7 |
14 | 79402259b334 |
15 | 38c3991a55da |
hex | 1c39762aaad2 |
31033121221330 has 8 divisors (see below), whose sum is σ = 55859618198412. Its totient is φ = 12413248488528.
The previous prime is 31033121221259. The next prime is 31033121221397. The reversal of 31033121221330 is 3312212133013.
It can be written as a sum of positive squares in 2 ways, for example, as 30917792382129 + 115328839201 = 5560377^2 + 339601^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×310331212213302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31033121221295 and 31033121221304.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 1551656061057 + ... + 1551656061076.
Almost surely, 231033121221330 is an apocalyptic number.
31033121221330 is a deficient number, since it is larger than the sum of its proper divisors (24826496977082).
31033121221330 is a wasteful number, since it uses less digits than its factorization.
31033121221330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3103312122140.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 31033121221330 its reverse (3312212133013), we get a palindrome (34345333354343).
The spelling of 31033121221330 in words is "thirty-one trillion, thirty-three billion, one hundred twenty-one million, two hundred twenty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •