Base | Representation |
---|---|
bin | 1010110100001… |
… | …1011010100110 |
3 | 10011100202221120 |
4 | 2231003122212 |
5 | 43103134102 |
6 | 4300154410 |
7 | 1060411122 |
oct | 255033246 |
9 | 104322846 |
10 | 45364902 |
11 | 23675360 |
12 | 13238a06 |
13 | 952474b |
14 | 604c582 |
15 | 3eb16bc |
hex | 2b436a6 |
45364902 has 32 divisors (see below), whose sum is σ = 100103040. Its totient is φ = 13590720.
The previous prime is 45364883. The next prime is 45364927. The reversal of 45364902 is 20946354.
45364902 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2013 + ... + 9735.
It is an arithmetic number, because the mean of its divisors is an integer number (3128220).
Almost surely, 245364902 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45364902, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50051520).
45364902 is an abundant number, since it is smaller than the sum of its proper divisors (54738138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45364902 is a wasteful number, since it uses less digits than its factorization.
45364902 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7828.
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 45364902 is about 6735.3472070859. The cubic root of 45364902 is about 356.6481637513.
The spelling of 45364902 in words is "forty-five million, three hundred sixty-four thousand, nine hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •