Base | Representation |
---|---|
bin | 10101000100010010… |
… | …00110101000010000 |
3 | 1002012020012012211121 |
4 | 22202021012220100 |
5 | 141130404330112 |
6 | 5110145252024 |
7 | 550164240403 |
oct | 124211065020 |
9 | 32166165747 |
10 | 11310230032 |
11 | 488436a252 |
12 | 2237934014 |
13 | 10b329790a |
14 | 794187d3a |
15 | 462e1e407 |
hex | 2a2246a10 |
11310230032 has 10 divisors (see below), whose sum is σ = 21913570718. Its totient is φ = 5655115008.
The previous prime is 11310230017. The next prime is 11310230039. The reversal of 11310230032 is 23003201311.
It can be written as a sum of positive squares in only one way, i.e., 8878162176 + 2432067856 = 94224^2 + 49316^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 706889377 = 11310230032 / (1 + 1 + 3 + 1 + 0 + 2 + 3 + 0 + 0 + 3 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11310229988 and 11310230015.
It is not an unprimeable number, because it can be changed into a prime (11310230039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 353444673 + ... + 353444704.
Almost surely, 211310230032 is an apocalyptic number.
It is an amenable number.
11310230032 is a deficient number, since it is larger than the sum of its proper divisors (10603340686).
11310230032 is an equidigital number, since it uses as much as digits as its factorization.
11310230032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706889385 (or 706889379 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 11310230032 its reverse (23003201311), we get a palindrome (34313431343).
The spelling of 11310230032 in words is "eleven billion, three hundred ten million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •