Base | Representation |
---|---|
bin | 100000100010111… |
… | …100001010010001 |
3 | 1102001110012122200 |
4 | 200202330022101 |
5 | 2104240431400 |
6 | 130103153413 |
7 | 16350115566 |
oct | 4042741221 |
9 | 1361405580 |
10 | 546030225 |
11 | 260246654 |
12 | 132a45869 |
13 | 89180610 |
14 | 5273886d |
15 | 32e0bb00 |
hex | 208bc291 |
546030225 has 144 divisors (see below), whose sum is σ = 1137427200. Its totient is φ = 248002560.
The previous prime is 546030217. The next prime is 546030229. The reversal of 546030225 is 522030645.
546030225 is a `hidden beast` number, since 54 + 603 + 0 + 2 + 2 + 5 = 666.
It is not a de Polignac number, because 546030225 - 23 = 546030217 is a prime.
It is a super-2 number, since 2×5460302252 = 596298013227101250, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (546030229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 3928206 + ... + 3928344.
It is an arithmetic number, because the mean of its divisors is an integer number (7898800).
Almost surely, 2546030225 is an apocalyptic number.
It is an amenable number.
546030225 is an abundant number, since it is smaller than the sum of its proper divisors (591396975).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
546030225 is a wasteful number, since it uses less digits than its factorization.
546030225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264 (or 256 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 546030225 is about 23367.2896374398. The cubic root of 546030225 is about 817.3452839663.
The spelling of 546030225 in words is "five hundred forty-six million, thirty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •