Base | Representation |
---|---|
bin | 101010011011010011… |
… | …010011100101100000 |
3 | 11100120211011001120112 |
4 | 222123103103211200 |
5 | 1221244112434100 |
6 | 32532222030452 |
7 | 3201620555111 |
oct | 523323234540 |
9 | 140524131515 |
10 | 45555202400 |
11 | 183577a6904 |
12 | 89b4418428 |
13 | 43acc53586 |
14 | 22c22b4208 |
15 | 12b955cb35 |
hex | a9b4d3960 |
45555202400 has 36 divisors (see below), whose sum is σ = 111211639812. Its totient is φ = 18222080640.
The previous prime is 45555202369. The next prime is 45555202403. The reversal of 45555202400 is 420255554.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45555202403) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 28471202 + ... + 28472801.
It is an arithmetic number, because the mean of its divisors is an integer number (3089212217).
Almost surely, 245555202400 is an apocalyptic number.
45555202400 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
45555202400 is an abundant number, since it is smaller than the sum of its proper divisors (65656437412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45555202400 is a wasteful number, since it uses less digits than its factorization.
45555202400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56944023 (or 56944010 counting only the distinct ones).
The product of its (nonzero) digits is 40000, while the sum is 32.
Adding to 45555202400 its reverse (420255554), we get a palindrome (45975457954).
The spelling of 45555202400 in words is "forty-five billion, five hundred fifty-five million, two hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •