Base | Representation |
---|---|
bin | 10101000110110011… |
… | …11010101111111000 |
3 | 1002020201001112012020 |
4 | 22203121322233320 |
5 | 141201320240112 |
6 | 5112223314440 |
7 | 550542303300 |
oct | 124331725770 |
9 | 32221045166 |
10 | 11331415032 |
11 | 4895319913 |
12 | 2242a4ba20 |
13 | 10b77a4512 |
14 | 796d00600 |
15 | 464c0648c |
hex | 2a367abf8 |
11331415032 has 48 divisors (see below), whose sum is σ = 32953608360. Its totient is φ = 3237546816.
The previous prime is 11331415031. The next prime is 11331415061. The reversal of 11331415032 is 23051413311.
It is a super-2 number, since 2×113314150322 (a number of 21 digits) contains 22 as substring.
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 = 11331414993 and 11331415011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331415031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4816603 + ... + 4818954.
Almost surely, 211331415032 is an apocalyptic number.
11331415032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11331415032 is an abundant number, since it is smaller than the sum of its proper divisors (21622193328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331415032 is a wasteful number, since it uses less digits than its factorization.
11331415032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9635580 (or 9635569 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 11331415032 its reverse (23051413311), we get a palindrome (34382828343).
The spelling of 11331415032 in words is "eleven billion, three hundred thirty-one million, four hundred fifteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •