Base | Representation |
---|---|
bin | 1000100110111111… |
… | …0100011010001111 |
3 | 12222001120200021021 |
4 | 2021233310122033 |
5 | 14213104422111 |
6 | 1021153015011 |
7 | 111161203144 |
oct | 21157643217 |
9 | 5861520237 |
10 | 2311014031 |
11 | a86564057 |
12 | 545b54467 |
13 | 2aaa30431 |
14 | 17ccd83cb |
15 | d7d49d71 |
hex | 89bf468f |
2311014031 has 8 divisors (see below), whose sum is σ = 2398500720. Its totient is φ = 2224047168.
The previous prime is 2311014001. The next prime is 2311014053. The reversal of 2311014031 is 1304101132.
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-2311014031 is a prime.
It is a super-2 number, since 2×23110140312 = 10681571702957737922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2311013996 and 2311014014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2311014001) 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, 120886 + ... + 138691.
It is an arithmetic number, because the mean of its divisors is an integer number (299812590).
Almost surely, 22311014031 is an apocalyptic number.
2311014031 is a deficient number, since it is larger than the sum of its proper divisors (87486689).
2311014031 is a wasteful number, since it uses less digits than its factorization.
2311014031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259913.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 2311014031 is about 48073.0073013952. The cubic root of 2311014031 is about 1322.1098091677.
Adding to 2311014031 its reverse (1304101132), we get a palindrome (3615115163).
The spelling of 2311014031 in words is "two billion, three hundred eleven million, fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •