Base | Representation |
---|---|
bin | 100111100000100111… |
… | …011010000100010001 |
3 | 11001111112121102022011 |
4 | 213200213122010101 |
5 | 1143340310214213 |
6 | 31253334542521 |
7 | 3031166450563 |
oct | 474047320421 |
9 | 131445542264 |
10 | 42423132433 |
11 | 16a9a830330 |
12 | 827b507a41 |
13 | 40010aa336 |
14 | 20a632d333 |
15 | 11845cc03d |
hex | 9e09da111 |
42423132433 has 32 divisors (see below), whose sum is σ = 49710661632. Its totient is φ = 35838379200.
The previous prime is 42423132419. The next prime is 42423132449. The reversal of 42423132433 is 33423132424.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 42423132433 - 225 = 42389578001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42423132395 and 42423132404.
It is not an unprimeable number, because it can be changed into a prime (42423132413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 824460 + ... + 874402.
It is an arithmetic number, because the mean of its divisors is an integer number (1553458176).
Almost surely, 242423132433 is an apocalyptic number.
It is an amenable number.
42423132433 is a deficient number, since it is larger than the sum of its proper divisors (7287529199).
42423132433 is a wasteful number, since it uses less digits than its factorization.
42423132433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50085.
The product of its digits is 41472, while the sum is 31.
Adding to 42423132433 its reverse (33423132424), we get a palindrome (75846264857).
Subtracting from 42423132433 its reverse (33423132424), we obtain a palindrome (9000000009).
The spelling of 42423132433 in words is "forty-two billion, four hundred twenty-three million, one hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •