Base | Representation |
---|---|
bin | 100000101111100010011… |
… | …1100101011110011110100 |
3 | 120221012122010221012012000 |
4 | 1001133010330223303310 |
5 | 1042212234030020312 |
6 | 13323200010455300 |
7 | 643060353243405 |
oct | 101370474536364 |
9 | 16835563835160 |
10 | 4500135001332 |
11 | 1485550987613 |
12 | 6081a6134530 |
13 | 26848cbc3549 |
14 | 117b444659ac |
15 | 7c0d38a8adc |
hex | 417c4f2bcf4 |
4500135001332 has 48 divisors (see below), whose sum is σ = 11667755769600. Its totient is φ = 1499949973440.
The previous prime is 4500135001321. The next prime is 4500135001339. The reversal of 4500135001332 is 2331005310054.
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 = 4500135001296 and 4500135001305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4500135001339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 403269 + ... + 3027027.
It is an arithmetic number, because the mean of its divisors is an integer number (243078245200).
Almost surely, 24500135001332 is an apocalyptic number.
It is an amenable number.
4500135001332 is an abundant number, since it is smaller than the sum of its proper divisors (7167620768268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4500135001332 is a wasteful number, since it uses less digits than its factorization.
4500135001332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2639653 (or 2639645 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The spelling of 4500135001332 in words is "four trillion, five hundred billion, one hundred thirty-five million, one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •