Base | Representation |
---|---|
bin | 111100001000001110011… |
… | …110100111101010001100 |
3 | 112122000102021200222001121 |
4 | 330020032132213222030 |
5 | 1020144314332242130 |
6 | 12442114255050324 |
7 | 604345563535432 |
oct | 74101636475214 |
9 | 15560367628047 |
10 | 4132001446540 |
11 | 1353410106150 |
12 | 568986b109a4 |
13 | 23c852532b56 |
14 | 103dc055cd52 |
15 | 727398b9d7a |
hex | 3c20e7a7a8c |
4132001446540 has 72 divisors (see below), whose sum is σ = 10055620158192. Its totient is φ = 1414160901120.
The previous prime is 4132001446519. The next prime is 4132001446553. The reversal of 4132001446540 is 456441002314.
4132001446540 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 4132001446496 and 4132001446505.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32430927 + ... + 32558086.
It is an arithmetic number, because the mean of its divisors is an integer number (139661391086).
Almost surely, 24132001446540 is an apocalyptic number.
It is an amenable number.
4132001446540 is an abundant number, since it is smaller than the sum of its proper divisors (5923618711652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4132001446540 is a wasteful number, since it uses less digits than its factorization.
4132001446540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64989067 (or 64989048 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 4132001446540 its reverse (456441002314), we get a palindrome (4588442448854).
The spelling of 4132001446540 in words is "four trillion, one hundred thirty-two billion, one million, four hundred forty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •