Base | Representation |
---|---|
bin | 1110001111000000111100… |
… | …11000010001000100011101 |
3 | 11002211110112022200120112220 |
4 | 13013200132120101010131 |
5 | 13100323432210043401 |
6 | 150324014020015553 |
7 | 6410340321151233 |
oct | 707403630210435 |
9 | 132743468616486 |
10 | 31302231331101 |
11 | 9a792245a2335 |
12 | 36166b9b315b9 |
13 | 1460a318b7b43 |
14 | 7a307100a953 |
15 | 394399a59336 |
hex | 1c781e61111d |
31302231331101 has 8 divisors (see below), whose sum is σ = 42040953029184. Its totient is φ = 20715831926880.
The previous prime is 31302231331081. The next prime is 31302231331109. The reversal of 31302231331101 is 10113313220313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31302231331101 - 218 = 31302231068957 is a prime.
It is a super-2 number, since 2×313022313311012 (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 (31302231331109) 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, 38080572985 + ... + 38080573806.
It is an arithmetic number, because the mean of its divisors is an integer number (5255119128648).
Almost surely, 231302231331101 is an apocalyptic number.
It is an amenable number.
31302231331101 is a deficient number, since it is larger than the sum of its proper divisors (10738721698083).
31302231331101 is a wasteful number, since it uses less digits than its factorization.
31302231331101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76161146931.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31302231331101 its reverse (10113313220313), we get a palindrome (41415544551414).
The spelling of 31302231331101 in words is "thirty-one trillion, three hundred two billion, two hundred thirty-one million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •