Base | Representation |
---|---|
bin | 1110000110001110001101… |
… | …01110011000001001000111 |
3 | 11001202120201011210021100001 |
4 | 13003013012232120021013 |
5 | 13030401212413142021 |
6 | 145533131052102131 |
7 | 6346453461663064 |
oct | 703070656301107 |
9 | 131676634707301 |
10 | 31000113021511 |
11 | 997208a6a1757 |
12 | 3588043164947 |
13 | 143b3b4c5a50a |
14 | 7925b0813c6b |
15 | 38b5b6418091 |
hex | 1c31c6b98247 |
31000113021511 has 16 divisors (see below), whose sum is σ = 32703845990400. Its totient is φ = 29303603618688.
The previous prime is 31000113021481. The next prime is 31000113021517. The reversal of 31000113021511 is 11512031100013.
It is a cyclic number.
It is not a de Polignac number, because 31000113021511 - 243 = 22204019999303 is a prime.
It is a super-2 number, since 2×310001130215112 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31000113021517) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136166671 + ... + 136394143.
It is an arithmetic number, because the mean of its divisors is an integer number (2043990374400).
Almost surely, 231000113021511 is an apocalyptic number.
31000113021511 is a deficient number, since it is larger than the sum of its proper divisors (1703732968889).
31000113021511 is a wasteful number, since it uses less digits than its factorization.
31000113021511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243318.
The product of its (nonzero) digits is 90, while the sum is 19.
Adding to 31000113021511 its reverse (11512031100013), we get a palindrome (42512144121524).
The spelling of 31000113021511 in words is "thirty-one trillion, one hundred thirteen million, twenty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •