Base | Representation |
---|---|
bin | 1110000110001110001001… |
… | …00100111101110110011001 |
3 | 11001202120121200000012020022 |
4 | 13003013010210331312121 |
5 | 13030401124203000324 |
6 | 145533123324040225 |
7 | 6346452543545261 |
oct | 703070444756631 |
9 | 131676550005208 |
10 | 31000077000089 |
11 | 997207132928a |
12 | 3588033093075 |
13 | 143b3aa657872 |
14 | 7925a9b187a1 |
15 | 38b5b31a005e |
hex | 1c31c493dd99 |
31000077000089 has 8 divisors (see below), whose sum is σ = 31164044021760. Its totient is φ = 30836523515616.
The previous prime is 31000077000071. The next prime is 31000077000143. The reversal of 31000077000089 is 98000077000013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31000077000089 is a prime.
It is a super-2 number, since 2×310000770000892 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31000077000889) 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 7 ways as a sum of consecutive naturals, for example, 103233977 + ... + 103533830.
It is an arithmetic number, because the mean of its divisors is an integer number (3895505502720).
Almost surely, 231000077000089 is an apocalyptic number.
It is an amenable number.
31000077000089 is a deficient number, since it is larger than the sum of its proper divisors (163967021671).
31000077000089 is a wasteful number, since it uses less digits than its factorization.
31000077000089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206768599.
The product of its (nonzero) digits is 10584, while the sum is 35.
The spelling of 31000077000089 in words is "thirty-one trillion, seventy-seven million, eighty-nine", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •