Base | Representation |
---|---|
bin | 111110000110111… |
… | …010101001000111 |
3 | 2200121201002220110 |
4 | 332012322221013 |
5 | 4113223003310 |
6 | 251221404103 |
7 | 34551600126 |
oct | 7606725107 |
9 | 2617632813 |
10 | 1042000455 |
11 | 495200401 |
12 | 250b69633 |
13 | 137b54422 |
14 | 9c561abd |
15 | 6172ad20 |
hex | 3e1baa47 |
1042000455 has 8 divisors (see below), whose sum is σ = 1667200752. Its totient is φ = 555733568.
The previous prime is 1042000447. The next prime is 1042000457. The reversal of 1042000455 is 5540002401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1042000455 - 23 = 1042000447 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042000457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34733334 + ... + 34733363.
It is an arithmetic number, because the mean of its divisors is an integer number (208400094).
Almost surely, 21042000455 is an apocalyptic number.
1042000455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1042000455 is a deficient number, since it is larger than the sum of its proper divisors (625200297).
1042000455 is an equidigital number, since it uses as much as digits as its factorization.
1042000455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69466705.
The product of its (nonzero) digits is 800, while the sum is 21.
The square root of 1042000455 is about 32280.0318308393. The cubic root of 1042000455 is about 1013.8085966627.
Adding to 1042000455 its reverse (5540002401), we get a palindrome (6582002856).
The spelling of 1042000455 in words is "one billion, forty-two million, four hundred fifty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •