Base | Representation |
---|---|
bin | 101000001010110100… |
… | …001011001100000001 |
3 | 11010022212211001000000 |
4 | 220022310023030001 |
5 | 1201313031404213 |
6 | 31451505350213 |
7 | 3054554330430 |
oct | 501264131401 |
9 | 133285731000 |
10 | 43131122433 |
11 | 17323437733 |
12 | 8438638369 |
13 | 40b4986429 |
14 | 2132387117 |
15 | 11c682bc73 |
hex | a0ad0b301 |
43131122433 has 112 divisors (see below), whose sum is σ = 78615415296. Its totient is φ = 23089121280.
The previous prime is 43131122429. The next prime is 43131122443. The reversal of 43131122433 is 33422113134.
It is a happy number.
43131122433 is a `hidden beast` number, since 431 + 3 + 1 + 1 + 224 + 3 + 3 = 666.
It is not a de Polignac number, because 43131122433 - 22 = 43131122429 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 43131122397 and 43131122406.
It is not an unprimeable number, because it can be changed into a prime (43131122413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 20905960 + ... + 20908022.
Almost surely, 243131122433 is an apocalyptic number.
It is an amenable number.
43131122433 is a deficient number, since it is larger than the sum of its proper divisors (35484292863).
43131122433 is a wasteful number, since it uses less digits than its factorization.
43131122433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2346 (or 2331 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
Adding to 43131122433 its reverse (33422113134), we get a palindrome (76553235567).
The spelling of 43131122433 in words is "forty-three billion, one hundred thirty-one million, one hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •