Base | Representation |
---|---|
bin | 1110001001001000100000… |
… | …11000010111011100110111 |
3 | 11002010010212202001022011111 |
4 | 13010210100120113130313 |
5 | 13034021033022411203 |
6 | 150051112011415451 |
7 | 6356624200614514 |
oct | 704442030273467 |
9 | 132103782038144 |
10 | 31100133013303 |
11 | 9a005463419a2 |
12 | 35a34b7754587 |
13 | 1447964949703 |
14 | 79737c39a30b |
15 | 38debc2a126d |
hex | 1c4910617737 |
31100133013303 has 8 divisors (see below), whose sum is σ = 31258325669472. Its totient is φ = 30941943629856.
The previous prime is 31100133013291. The next prime is 31100133013309. The reversal of 31100133013303 is 30331033100113.
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 31100133013303 - 29 = 31100133012791 is a prime.
It is a super-3 number, since 3×311001330133033 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31100133013309) 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, 19517901 + ... + 21051097.
It is an arithmetic number, because the mean of its divisors is an integer number (3907290708684).
Almost surely, 231100133013303 is an apocalyptic number.
31100133013303 is a deficient number, since it is larger than the sum of its proper divisors (158192656169).
31100133013303 is a wasteful number, since it uses less digits than its factorization.
31100133013303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1636361.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 31100133013303 its reverse (30331033100113), we get a palindrome (61431166113416).
The spelling of 31100133013303 in words is "thirty-one trillion, one hundred billion, one hundred thirty-three million, thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •