Base | Representation |
---|---|
bin | 101011110110010010110… |
… | …001001001110001110111 |
3 | 101200001200111012010201121 |
4 | 223312102301021301313 |
5 | 343332101003330033 |
6 | 10224132155204411 |
7 | 430461521040214 |
oct | 53662261116167 |
9 | 11601614163647 |
10 | 3013234433143 |
11 | a619a6312230 |
12 | 407b9a146707 |
13 | 18b1ba65392c |
14 | a5bac848b0b |
15 | 535ab55262d |
hex | 2bd92c49c77 |
3013234433143 has 16 divisors (see below), whose sum is σ = 3309058690560. Its totient is φ = 2721091838400.
The previous prime is 3013234433141. The next prime is 3013234433147. The reversal of 3013234433143 is 3413344323103.
It is a cyclic number.
It is not a de Polignac number, because 3013234433143 - 21 = 3013234433141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3013234433099 and 3013234433108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013234433141) 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 15 ways as a sum of consecutive naturals, for example, 1028338 + ... + 2661568.
It is an arithmetic number, because the mean of its divisors is an integer number (206816168160).
Almost surely, 23013234433143 is an apocalyptic number.
3013234433143 is a deficient number, since it is larger than the sum of its proper divisors (295824257417).
3013234433143 is a wasteful number, since it uses less digits than its factorization.
3013234433143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1634358.
The product of its (nonzero) digits is 93312, while the sum is 34.
Adding to 3013234433143 its reverse (3413344323103), we get a palindrome (6426578756246).
The spelling of 3013234433143 in words is "three trillion, thirteen billion, two hundred thirty-four million, four hundred thirty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •