Base | Representation |
---|---|
bin | 11101000110010011… |
… | …010100110110011101 |
3 | 2222122110112221222111 |
4 | 131012103110312131 |
5 | 1002442011223313 |
6 | 22204200314021 |
7 | 2154155451343 |
oct | 350623246635 |
9 | 88573487874 |
10 | 31244242333 |
11 | 12283618787 |
12 | 607b772911 |
13 | 2c3c0aa075 |
14 | 17257b3993 |
15 | c2cea343d |
hex | 7464d4d9d |
31244242333 has 8 divisors (see below), whose sum is σ = 32905746720. Its totient is φ = 29584445040.
The previous prime is 31244242313. The next prime is 31244242339. The reversal of 31244242333 is 33324244213.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31244242333 - 213 = 31244234141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31244242295 and 31244242304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31244242339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 389110 + ... + 462487.
It is an arithmetic number, because the mean of its divisors is an integer number (4113218340).
Almost surely, 231244242333 is an apocalyptic number.
It is an amenable number.
31244242333 is a deficient number, since it is larger than the sum of its proper divisors (1661504387).
31244242333 is a wasteful number, since it uses less digits than its factorization.
31244242333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 853547.
The product of its digits is 41472, while the sum is 31.
Adding to 31244242333 its reverse (33324244213), we get a palindrome (64568486546).
The spelling of 31244242333 in words is "thirty-one billion, two hundred forty-four million, two hundred forty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •