Base | Representation |
---|---|
bin | 1010000010001101101010… |
… | …1000010100110001000000 |
3 | 1110001202110202222100100220 |
4 | 2200203122220110301000 |
5 | 2421231334332120112 |
6 | 35244320102543040 |
7 | 2216055410540331 |
oct | 240433250246100 |
9 | 43052422870326 |
10 | 11033144020032 |
11 | 3574148190802 |
12 | 12a2369737a80 |
13 | 620561c87724 |
14 | 2a2015396288 |
15 | 141ee632498c |
hex | a08daa14c40 |
11033144020032 has 56 divisors (see below), whose sum is σ = 30728273925600. Its totient is φ = 3484150742016.
The previous prime is 11033144019979. The next prime is 11033144020037. The reversal of 11033144020032 is 23002044133011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 11033144019984 and 11033144020011.
It is not an unprimeable number, because it can be changed into a prime (11033144020037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1512214557 + ... + 1512221852.
Almost surely, 211033144020032 is an apocalyptic number.
11033144020032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11033144020032 is an abundant number, since it is smaller than the sum of its proper divisors (19695129905568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033144020032 is a wasteful number, since it uses less digits than its factorization.
11033144020032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3024436443 (or 3024436433 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 11033144020032 its reverse (23002044133011), we get a palindrome (34035188153043).
The spelling of 11033144020032 in words is "eleven trillion, thirty-three billion, one hundred forty-four million, twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •