Base | Representation |
---|---|
bin | 111110001000101… |
… | …001100000000111 |
3 | 2200122120011210020 |
4 | 332020221200013 |
5 | 4113332021120 |
6 | 251235230223 |
7 | 34555501023 |
oct | 7610514007 |
9 | 2618504706 |
10 | 1042454535 |
11 | 495490581 |
12 | 251148373 |
13 | 137c83005 |
14 | 9c63d383 |
15 | 617ba640 |
hex | 3e229807 |
1042454535 has 32 divisors (see below), whose sum is σ = 1775001600. Its totient is φ = 520616448.
The previous prime is 1042454489. The next prime is 1042454557. The reversal of 1042454535 is 5354542401.
It is not a de Polignac number, because 1042454535 - 26 = 1042454471 is a prime.
It is a super-2 number, since 2×10424545352 = 2173422915084132450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1042454496 and 1042454505.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 40474 + ... + 61016.
It is an arithmetic number, because the mean of its divisors is an integer number (55468800).
Almost surely, 21042454535 is an apocalyptic number.
1042454535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1042454535 is a deficient number, since it is larger than the sum of its proper divisors (732547065).
1042454535 is a wasteful number, since it uses less digits than its factorization.
1042454535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20767.
The product of its (nonzero) digits is 48000, while the sum is 33.
The square root of 1042454535 is about 32287.0645150655. The cubic root of 1042454535 is about 1013.9558401537.
Adding to 1042454535 its reverse (5354542401), we get a palindrome (6396996936).
The spelling of 1042454535 in words is "one billion, forty-two million, four hundred fifty-four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •