Base | Representation |
---|---|
bin | 10110010011101101111… |
… | …100100101110100101100 |
3 | 12102112221102210020120000 |
4 | 112103231330211310230 |
5 | 200104041103104012 |
6 | 3132130051424300 |
7 | 215520115515126 |
oct | 26235574456454 |
9 | 5375842706500 |
10 | 1533000441132 |
11 | 541161869236 |
12 | 2091328b5090 |
13 | b173b2b8954 |
14 | 542aa394216 |
15 | 29d24602ddc |
hex | 164edf25d2c |
1533000441132 has 30 divisors (see below), whose sum is σ = 4007565968868. Its totient is φ = 511000146936.
The previous prime is 1533000441103. The next prime is 1533000441143. The reversal of 1533000441132 is 2311440003351.
It is a happy number.
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 = 1533000441096 and 1533000441105.
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 2365741098 + ... + 2365741745.
Almost surely, 21533000441132 is an apocalyptic number.
1533000441132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1533000441132 is an abundant number, since it is smaller than the sum of its proper divisors (2474565527736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1533000441132 is a wasteful number, since it uses less digits than its factorization.
1533000441132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4731482859 (or 4731482848 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 1533000441132 its reverse (2311440003351), we get a palindrome (3844440444483).
The spelling of 1533000441132 in words is "one trillion, five hundred thirty-three billion, four hundred forty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •