Base | Representation |
---|---|
bin | 10101000011010110… |
… | …11100010010100000 |
3 | 1002011200120011201102 |
4 | 22201223130102200 |
5 | 141121412020212 |
6 | 5105310453532 |
7 | 550041164123 |
oct | 124153342240 |
9 | 32150504642 |
10 | 11302454432 |
11 | 487aa39335 |
12 | 22352042a8 |
13 | 10b17a4679 |
14 | 7931223ba |
15 | 4623d55c2 |
hex | 2a1adc4a0 |
11302454432 has 48 divisors (see below), whose sum is σ = 23035781160. Its totient is φ = 5452382208.
The previous prime is 11302454353. The next prime is 11302454447. The reversal of 11302454432 is 23445420311.
It can be written as a sum of positive squares in 4 ways, for example, as 10950366736 + 352087696 = 104644^2 + 18764^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 11302454395 and 11302454404.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1571228 + ... + 1578404.
Almost surely, 211302454432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11302454432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11517890580).
11302454432 is an abundant number, since it is smaller than the sum of its proper divisors (11733326728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11302454432 is a wasteful number, since it uses less digits than its factorization.
11302454432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8913 (or 8905 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 11302454432 its reverse (23445420311), we get a palindrome (34747874743).
The spelling of 11302454432 in words is "eleven billion, three hundred two million, four hundred fifty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •