Base | Representation |
---|---|
bin | 1110100000011010100101… |
… | …10010100111111101111001 |
3 | 11011221121202120222020111000 |
4 | 13100031102302213331321 |
5 | 13140122411421010014 |
6 | 151502413030355213 |
7 | 6501464330342532 |
oct | 720152262477571 |
9 | 134847676866430 |
10 | 31900111110009 |
11 | a1898410a639a |
12 | 36b25567bbb09 |
13 | 14a52241c754c |
14 | 7c3d8b85d689 |
15 | 3a4bdd6b8509 |
hex | 1d0352ca7f79 |
31900111110009 has 8 divisors (see below), whose sum is σ = 47259423866720. Its totient is φ = 21266740739988.
The previous prime is 31900111110001. The next prime is 31900111110041. The reversal of 31900111110009 is 90001111100913.
It is not a de Polignac number, because 31900111110009 - 23 = 31900111110001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1181485596667 = 31900111110009 / (3 + 1 + 9 + 0 + 0 + 1 + 1 + 1 + 1 + 1 + 0 + 0 + 0 + 9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31900111110001) 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, 590742798307 + ... + 590742798360.
It is an arithmetic number, because the mean of its divisors is an integer number (5907427983340).
Almost surely, 231900111110009 is an apocalyptic number.
It is an amenable number.
31900111110009 is a deficient number, since it is larger than the sum of its proper divisors (15359312756711).
31900111110009 is a wasteful number, since it uses less digits than its factorization.
31900111110009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181485596676 (or 1181485596670 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 27.
The spelling of 31900111110009 in words is "thirty-one trillion, nine hundred billion, one hundred eleven million, one hundred ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •