Base | Representation |
---|---|
bin | 1011100110100101… |
… | …1100100110111011 |
3 | 22001001202121122000 |
4 | 2321221130212323 |
5 | 22334322300133 |
6 | 1233021432043 |
7 | 140120042241 |
oct | 27151344673 |
9 | 8031677560 |
10 | 3114650043 |
11 | 135915874a |
12 | 72b10b623 |
13 | 3a83872bb |
14 | 21792c791 |
15 | 13368e413 |
hex | b9a5c9bb |
3114650043 has 16 divisors (see below), whose sum is σ = 4615460640. Its totient is φ = 2075909472.
The previous prime is 3114650029. The next prime is 3114650111. The reversal of 3114650043 is 3400564113.
3114650043 is a `hidden beast` number, since 3 + 1 + 1 + 4 + 650 + 0 + 4 + 3 = 666.
It is not a de Polignac number, because 3114650043 - 213 = 3114641851 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 3114649989 and 3114650016.
It is not an unprimeable number, because it can be changed into a prime (3114650243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115605 + ... + 139977.
It is an arithmetic number, because the mean of its divisors is an integer number (288466290).
Almost surely, 23114650043 is an apocalyptic number.
3114650043 is a deficient number, since it is larger than the sum of its proper divisors (1500810597).
3114650043 is a wasteful number, since it uses less digits than its factorization.
3114650043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29115 (or 29109 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 3114650043 is about 55809.0498306502. The cubic root of 3114650043 is about 1460.3930328297.
The spelling of 3114650043 in words is "three billion, one hundred fourteen million, six hundred fifty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •