Base | Representation |
---|---|
bin | 10101010011000010… |
… | …11100100110100000 |
3 | 1002111212012000122102 |
4 | 22221201130212200 |
5 | 141404104131000 |
6 | 5130331225532 |
7 | 553226560400 |
oct | 125141344640 |
9 | 32455160572 |
10 | 11434052000 |
11 | 4938251558 |
12 | 22712a82a8 |
13 | 1102b2c357 |
14 | 7a67ba800 |
15 | 46dc2c3d5 |
hex | 2a985c9a0 |
11434052000 has 144 divisors (see below), whose sum is σ = 32680714248. Its totient is φ = 3920179200.
The previous prime is 11434051991. The next prime is 11434052011. The reversal of 11434052000 is 25043411.
It can be written as a sum of positive squares in 4 ways, for example, as 7004350864 + 4429701136 = 83692^2 + 66556^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 166832 + ... + 225168.
Almost surely, 211434052000 is an apocalyptic number.
11434052000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11434052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16340357124).
11434052000 is an abundant number, since it is smaller than the sum of its proper divisors (21246662248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11434052000 is an equidigital number, since it uses as much as digits as its factorization.
11434052000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58376 (or 58351 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 11434052000 its reverse (25043411), we get a palindrome (11459095411).
The spelling of 11434052000 in words is "eleven billion, four hundred thirty-four million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •