Base | Representation |
---|---|
bin | 1000011110111000… |
… | …10011011011000101 |
3 | 102202101020110110222 |
4 | 10033130103123011 |
5 | 33311313421000 |
6 | 2031520554125 |
7 | 220565513330 |
oct | 41734233305 |
9 | 12671213428 |
10 | 4554045125 |
11 | 1a27704563 |
12 | a71182945 |
13 | 57764a176 |
14 | 312b77617 |
15 | 1b9c16a85 |
hex | 10f7136c5 |
4554045125 has 32 divisors (see below), whose sum is σ = 6501431040. Its totient is φ = 3119860800.
The previous prime is 4554045113. The next prime is 4554045227. The reversal of 4554045125 is 5215404554.
4554045125 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4554045125 - 24 = 4554045109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1395746 + ... + 1399004.
It is an arithmetic number, because the mean of its divisors is an integer number (203169720).
Almost surely, 24554045125 is an apocalyptic number.
It is an amenable number.
4554045125 is a deficient number, since it is larger than the sum of its proper divisors (1947385915).
4554045125 is a wasteful number, since it uses less digits than its factorization.
4554045125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4878 (or 4868 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 35.
The square root of 4554045125 is about 67483.6656162067. The cubic root of 4554045125 is about 1657.5467130029.
Adding to 4554045125 its reverse (5215404554), we get a palindrome (9769449679).
The spelling of 4554045125 in words is "four billion, five hundred fifty-four million, forty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •