Base | Representation |
---|---|
bin | 10100110010101001… |
… | …11010011000001010 |
3 | 1001210220220011000010 |
4 | 22121110322120022 |
5 | 140330024040014 |
6 | 5043343252350 |
7 | 543420150000 |
oct | 123124723012 |
9 | 31726804003 |
10 | 11162330634 |
11 | 4808932244 |
12 | 21b62aa0b6 |
13 | 108b752b90 |
14 | 77c688a70 |
15 | 454e57359 |
hex | 29953a60a |
11162330634 has 160 divisors (see below), whose sum is σ = 29532847680. Its totient is φ = 2788079616.
The previous prime is 11162330623. The next prime is 11162330639. The reversal of 11162330634 is 43603326111.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11162330639) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3556714 + ... + 3559850.
It is an arithmetic number, because the mean of its divisors is an integer number (184580298).
Almost surely, 211162330634 is an apocalyptic number.
11162330634 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11162330634, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14766423840).
11162330634 is an abundant number, since it is smaller than the sum of its proper divisors (18370517046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11162330634 is a wasteful number, since it uses less digits than its factorization.
11162330634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3202 (or 3181 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 11162330634 its reverse (43603326111), we get a palindrome (54765656745).
The spelling of 11162330634 in words is "eleven billion, one hundred sixty-two million, three hundred thirty thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •