Base | Representation |
---|---|
bin | 1010001010001110… |
… | …11011011100001101 |
3 | 112002010200110210111 |
4 | 11011013123130031 |
5 | 42132330330410 |
6 | 2301125440021 |
7 | 252111563401 |
oct | 50507333415 |
9 | 15063613714 |
10 | 5454542605 |
11 | 2349a46656 |
12 | 1082870011 |
13 | 68c089105 |
14 | 39a5c3101 |
15 | 21dce0b8a |
hex | 1451db70d |
5454542605 has 8 divisors (see below), whose sum is σ = 6550199064. Its totient is φ = 4360468800.
The previous prime is 5454542551. The next prime is 5454542609. The reversal of 5454542605 is 5062454545.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1901641 + 5452640964 = 1379^2 + 73842^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5454542605 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5454542609) 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, 388066 + ... + 401875.
It is an arithmetic number, because the mean of its divisors is an integer number (818774883).
Almost surely, 25454542605 is an apocalyptic number.
It is an amenable number.
5454542605 is a deficient number, since it is larger than the sum of its proper divisors (1095656459).
5454542605 is a wasteful number, since it uses less digits than its factorization.
5454542605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791327.
The product of its (nonzero) digits is 480000, while the sum is 40.
The square root of 5454542605 is about 73854.8752960832. The cubic root of 5454542605 is about 1760.2976645514.
The spelling of 5454542605 in words is "five billion, four hundred fifty-four million, five hundred forty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •