Base | Representation |
---|---|
bin | 1110000111001011100000… |
… | …10100011100001001111111 |
3 | 11001212201122201221111100122 |
4 | 13003211300110130021333 |
5 | 13031421112404314444 |
6 | 150000212441445155 |
7 | 6352030146132065 |
oct | 703456024341177 |
9 | 131781581844318 |
10 | 31033023119999 |
11 | 998503858185a |
12 | 35924a87a07bb |
13 | 144152b1ba984 |
14 | 794013542035 |
15 | 38c3907784ee |
hex | 1c397051c27f |
31033023119999 has 12 divisors (see below), whose sum is σ = 31772045745000. Its totient is φ = 30310809029424.
The previous prime is 31033023119971. The next prime is 31033023120031. The reversal of 31033023119999 is 99991132033013.
It is a happy number.
It is not a de Polignac number, because 31033023119999 - 228 = 31032754684543 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 31033023119999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31033023119939) 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 in 11 ways as a sum of consecutive naturals, for example, 152808977 + ... + 153011925.
It is an arithmetic number, because the mean of its divisors is an integer number (2647670478750).
Almost surely, 231033023119999 is an apocalyptic number.
31033023119999 is a deficient number, since it is larger than the sum of its proper divisors (739022625001).
31033023119999 is an equidigital number, since it uses as much as digits as its factorization.
31033023119999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285734 (or 285691 counting only the distinct ones).
The product of its (nonzero) digits is 1062882, while the sum is 53.
The spelling of 31033023119999 in words is "thirty-one trillion, thirty-three billion, twenty-three million, one hundred nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •