Base | Representation |
---|---|
bin | 100001001000001110100… |
… | …0001000010011110101000 |
3 | 121010021111000001011021111 |
4 | 1002100131001002132220 |
5 | 1044044323422122240 |
6 | 13403404512120104 |
7 | 646645232444332 |
oct | 102203501023650 |
9 | 17107430034244 |
10 | 4553152145320 |
11 | 14a5a8775a599 |
12 | 616521536034 |
13 | 27048ba6ac6c |
14 | 11a533782452 |
15 | 7d68807c1ea |
hex | 4241d0427a8 |
4553152145320 has 64 divisors (see below), whose sum is σ = 10512148896000. Its totient is φ = 1774062554880.
The previous prime is 4553152145317. The next prime is 4553152145327. The reversal of 4553152145320 is 235412513554.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (4553152145327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5342395 + ... + 6135754.
It is an arithmetic number, because the mean of its divisors is an integer number (164252326500).
Almost surely, 24553152145320 is an apocalyptic number.
4553152145320 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4553152145320 is an abundant number, since it is smaller than the sum of its proper divisors (5958996750680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4553152145320 is a wasteful number, since it uses less digits than its factorization.
4553152145320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11478418 (or 11478414 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 40.
Adding to 4553152145320 its reverse (235412513554), we get a palindrome (4788564658874).
The spelling of 4553152145320 in words is "four trillion, five hundred fifty-three billion, one hundred fifty-two million, one hundred forty-five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •