Base | Representation |
---|---|
bin | 100000101111101000000… |
… | …0000000111111000101100 |
3 | 120221020010001220001212110 |
4 | 1001133100000013320230 |
5 | 1042213124013432030 |
6 | 13323230233404020 |
7 | 643065064453332 |
oct | 101372000077054 |
9 | 16836101801773 |
10 | 4500320452140 |
11 | 1485636632547 |
12 | 608238269610 |
13 | 2684bc455456 |
14 | 117b60d3bb52 |
15 | 7c0e4cdc1b0 |
hex | 417d0007e2c |
4500320452140 has 24 divisors (see below), whose sum is σ = 12600897266160. Its totient is φ = 1200085453888.
The previous prime is 4500320452129. The next prime is 4500320452157. The reversal of 4500320452140 is 412540230054.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 4500320452098 and 4500320452107.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 37502670375 + ... + 37502670494.
It is an arithmetic number, because the mean of its divisors is an integer number (525037386090).
Almost surely, 24500320452140 is an apocalyptic number.
It is an amenable number.
4500320452140 is an abundant number, since it is smaller than the sum of its proper divisors (8100576814020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4500320452140 is a wasteful number, since it uses less digits than its factorization.
4500320452140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75005340881 (or 75005340879 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 4500320452140 its reverse (412540230054), we get a palindrome (4912860682194).
The spelling of 4500320452140 in words is "four trillion, five hundred billion, three hundred twenty million, four hundred fifty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •