Base | Representation |
---|---|
bin | 10100110001011101… |
… | …01101000001011110 |
3 | 1001210020001021101210 |
4 | 22120232231001132 |
5 | 140314443030322 |
6 | 5042344445250 |
7 | 543236052222 |
oct | 123056550136 |
9 | 31706037353 |
10 | 11152314462 |
11 | 4803210a13 |
12 | 21b2a79826 |
13 | 1089656b53 |
14 | 77b1dc782 |
15 | 45412970c |
hex | 298bad05e |
11152314462 has 8 divisors (see below), whose sum is σ = 22304628936. Its totient is φ = 3717438152.
The previous prime is 11152314409. The next prime is 11152314469. The reversal of 11152314462 is 26441325111.
11152314462 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
11152314462 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11152314469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 929359533 + ... + 929359544.
It is an arithmetic number, because the mean of its divisors is an integer number (2788078617).
Almost surely, 211152314462 is an apocalyptic number.
11152314462 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11152314462 is a wasteful number, since it uses less digits than its factorization.
11152314462 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1858719082.
The product of its digits is 5760, while the sum is 30.
Adding to 11152314462 its reverse (26441325111), we get a palindrome (37593639573).
The spelling of 11152314462 in words is "eleven billion, one hundred fifty-two million, three hundred fourteen thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.958 sec. • engine limits •