Base | Representation |
---|---|
bin | 11100111000011010… |
… | …000101011011000011 |
3 | 2222001012220210021001 |
4 | 130320122011123003 |
5 | 1002002322224443 |
6 | 22125112112431 |
7 | 2145325165555 |
oct | 347032053303 |
9 | 88035823231 |
10 | 31011133123 |
11 | 12173a81343 |
12 | 6015695717 |
13 | 2c029cc819 |
14 | 17028534d5 |
15 | c177a8d4d |
hex | 7386856c3 |
31011133123 has 8 divisors (see below), whose sum is σ = 32033125376. Its totient is φ = 29990493000.
The previous prime is 31011133057. The next prime is 31011133159. The reversal of 31011133123 is 32133111013.
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 31011133123 - 29 = 31011132611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31011133123.
It is not an unprimeable number, because it can be changed into a prime (31011133163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 291303 + ... + 383248.
It is an arithmetic number, because the mean of its divisors is an integer number (4004140672).
Almost surely, 231011133123 is an apocalyptic number.
31011133123 is a deficient number, since it is larger than the sum of its proper divisors (1021992253).
31011133123 is a wasteful number, since it uses less digits than its factorization.
31011133123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 676065.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 31011133123 its reverse (32133111013), we get a palindrome (63144244136).
The spelling of 31011133123 in words is "thirty-one billion, eleven million, one hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •