Base | Representation |
---|---|
bin | 101001111010111111… |
… | …001011011110101000 |
3 | 11022012001000010201000 |
4 | 221322333023132220 |
5 | 1214141320233100 |
6 | 32402333555000 |
7 | 3152315441445 |
oct | 517277133650 |
9 | 138161003630 |
10 | 45013055400 |
11 | 180a9772835 |
12 | 8882945a60 |
13 | 4324832631 |
14 | 22702aa9cc |
15 | 1286b6b900 |
hex | a7afcb7a8 |
45013055400 has 192 divisors, whose sum is σ = 158827334400. Its totient is φ = 11710656000.
The previous prime is 45013055323. The next prime is 45013055537. The reversal of 45013055400 is 455031054.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 119745 + ... + 323055.
It is an arithmetic number, because the mean of its divisors is an integer number (827225700).
Almost surely, 245013055400 is an apocalyptic number.
45013055400 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45013055400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79413667200).
45013055400 is an abundant number, since it is smaller than the sum of its proper divisors (113814279000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45013055400 is a wasteful number, since it uses less digits than its factorization.
45013055400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203377 (or 203362 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
Adding to 45013055400 its reverse (455031054), we get a palindrome (45468086454).
The spelling of 45013055400 in words is "forty-five billion, thirteen million, fifty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •