Base | Representation |
---|---|
bin | 1010110001110… |
… | …0010010010111 |
3 | 10011001122002121 |
4 | 2230130102113 |
5 | 43033022011 |
6 | 4252520411 |
7 | 1056142633 |
oct | 254342227 |
9 | 104048077 |
10 | 45204631 |
11 | 235759aa |
12 | 13180107 |
13 | 9499804 |
14 | 6009dc3 |
15 | 3e7de71 |
hex | 2b1c497 |
45204631 has 2 divisors, whose sum is σ = 45204632. Its totient is φ = 45204630.
The previous prime is 45204623. The next prime is 45204659. The reversal of 45204631 is 13640254.
45204631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 45204631 - 23 = 45204623 is a prime.
It is a super-2 number, since 2×452046312 = 4086917327692322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 45204596 and 45204605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45204661) by changing a digit.
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 as a sum of consecutive naturals, namely, 22602315 + 22602316.
It is an arithmetic number, because the mean of its divisors is an integer number (22602316).
Almost surely, 245204631 is an apocalyptic number.
45204631 is a deficient number, since it is larger than the sum of its proper divisors (1).
45204631 is an equidigital number, since it uses as much as digits as its factorization.
45204631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 45204631 is about 6723.4389266208. The cubic root of 45204631 is about 356.2276638915.
Adding to 45204631 its reverse (13640254), we get a palindrome (58844885).
The spelling of 45204631 in words is "forty-five million, two hundred four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •