Base | Representation |
---|---|
bin | 101101111101111… |
… | …1111000100000000 |
3 | 10222111101122121201 |
4 | 1123323333010000 |
5 | 11124331421311 |
6 | 413020030544 |
7 | 53136423010 |
oct | 13373770400 |
9 | 3874348551 |
10 | 1542451456 |
11 | 721745677 |
12 | 370692454 |
13 | 1b7736890 |
14 | 108bd3c40 |
15 | 906329c1 |
hex | 5beff100 |
1542451456 has 144 divisors (see below), whose sum is σ = 3845532544. Its totient is φ = 601178112.
The previous prime is 1542451453. The next prime is 1542451457. The reversal of 1542451456 is 6541542451.
It is not an unprimeable number, because it can be changed into a prime (1542451453) 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 15 ways as a sum of consecutive naturals, for example, 1700155 + ... + 1701061.
Almost surely, 21542451456 is an apocalyptic number.
1542451456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1542451456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1922766272).
1542451456 is an abundant number, since it is smaller than the sum of its proper divisors (2303081088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1542451456 is an equidigital number, since it uses as much as digits as its factorization.
1542451456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016 (or 1002 counting only the distinct ones).
The product of its digits is 96000, while the sum is 37.
The square root of 1542451456 is about 39274.0557620422. The cubic root of 1542451456 is about 1155.4127835004.
The spelling of 1542451456 in words is "one billion, five hundred forty-two million, four hundred fifty-one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •