Base | Representation |
---|---|
bin | 1110000110001110100111… |
… | …10001110000011001111101 |
3 | 11001202121021102212002121210 |
4 | 13003013103301300121331 |
5 | 13030402134443324013 |
6 | 145533204513515033 |
7 | 6346462061240562 |
oct | 703072361603175 |
9 | 131677242762553 |
10 | 31000332011133 |
11 | 9972192274911 |
12 | 35880a4572a79 |
13 | 143b41b433084 |
14 | 7925d193a869 |
15 | 38b5ca773cc3 |
hex | 1c31d3c7067d |
31000332011133 has 8 divisors (see below), whose sum is σ = 41915941874496. Its totient is φ = 20375805077600.
The previous prime is 31000332011111. The next prime is 31000332011149. The reversal of 31000332011133 is 33111023300013.
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 31000332011133 - 25 = 31000332011101 is a prime.
It is a super-2 number, since 2×310003320111332 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31000332011833) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72770732208 + ... + 72770732633.
It is an arithmetic number, because the mean of its divisors is an integer number (5239492734312).
Almost surely, 231000332011133 is an apocalyptic number.
It is an amenable number.
31000332011133 is a deficient number, since it is larger than the sum of its proper divisors (10915609863363).
31000332011133 is a wasteful number, since it uses less digits than its factorization.
31000332011133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145541464915.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 31000332011133 its reverse (33111023300013), we get a palindrome (64111355311146).
The spelling of 31000332011133 in words is "thirty-one trillion, three hundred thirty-two million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •