Base | Representation |
---|---|
bin | 11011000010110… |
… | …111000000101010 |
3 | 1011121210002122100 |
4 | 123002313000222 |
5 | 1412124000232 |
6 | 113005034230 |
7 | 14146451640 |
oct | 3302670052 |
9 | 1147702570 |
10 | 453734442 |
11 | 213137447 |
12 | 107b55976 |
13 | 73006725 |
14 | 44391190 |
15 | 29c79c7c |
hex | 1b0b702a |
453734442 has 48 divisors (see below), whose sum is σ = 1124952192. Its totient is φ = 129474720.
The previous prime is 453734401. The next prime is 453734447. The reversal of 453734442 is 244437354.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 453734397 and 453734406.
It is not an unprimeable number, because it can be changed into a prime (453734447) 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 23 ways as a sum of consecutive naturals, for example, 126883 + ... + 130409.
It is an arithmetic number, because the mean of its divisors is an integer number (23436504).
Almost surely, 2453734442 is an apocalyptic number.
453734442 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
453734442 is an abundant number, since it is smaller than the sum of its proper divisors (671217750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
453734442 is a wasteful number, since it uses less digits than its factorization.
453734442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4563 (or 4560 counting only the distinct ones).
The product of its digits is 161280, while the sum is 36.
The square root of 453734442 is about 21301.0432138898. The cubic root of 453734442 is about 768.4234013813.
The spelling of 453734442 in words is "four hundred fifty-three million, seven hundred thirty-four thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •