Base | Representation |
---|---|
bin | 101001111100100110… |
… | …000010101111010011 |
3 | 11022020220202002210000 |
4 | 221330212002233103 |
5 | 1214220221123220 |
6 | 32405135541043 |
7 | 3153063566634 |
oct | 517446025723 |
9 | 138226662700 |
10 | 45040020435 |
11 | 18112a0aa93 |
12 | 888b98a783 |
13 | 432a2b4087 |
14 | 2273ac988b |
15 | 12891e6390 |
hex | a7c982bd3 |
45040020435 has 80 divisors (see below), whose sum is σ = 84518387712. Its totient is φ = 22918593600.
The previous prime is 45040020433. The next prime is 45040020463. The reversal of 45040020435 is 53402004054.
45040020435 is a `hidden beast` number, since 4 + 50 + 400 + 204 + 3 + 5 = 666.
It is not a de Polignac number, because 45040020435 - 21 = 45040020433 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 45040020399 and 45040020408.
It is not an unprimeable number, because it can be changed into a prime (45040020433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 866142 + ... + 916668.
Almost surely, 245040020435 is an apocalyptic number.
45040020435 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
45040020435 is a deficient number, since it is larger than the sum of its proper divisors (39478367277).
45040020435 is a wasteful number, since it uses less digits than its factorization.
45040020435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50646 (or 50637 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 27.
Adding to 45040020435 its reverse (53402004054), we get a palindrome (98442024489).
The spelling of 45040020435 in words is "forty-five billion, forty million, twenty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •