Base | Representation |
---|---|
bin | 10100111010101110… |
… | …01011000010001110 |
3 | 1001222122021201211122 |
4 | 22131113023002032 |
5 | 140444342011024 |
6 | 5054202320542 |
7 | 545201461055 |
oct | 123527130216 |
9 | 31878251748 |
10 | 11230032014 |
11 | 48430732a3 |
12 | 2214ab9152 |
13 | 109c798376 |
14 | 78766d39c |
15 | 45ad7bd5e |
hex | 29d5cb08e |
11230032014 has 4 divisors (see below), whose sum is σ = 16845048024. Its totient is φ = 5615016006.
The previous prime is 11230032013. The next prime is 11230032017. The reversal of 11230032014 is 41023003211.
11230032014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×112300320142 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11230031983 and 11230032001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230032013) 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 as a sum of consecutive naturals, namely, 2807508002 + ... + 2807508005.
It is an arithmetic number, because the mean of its divisors is an integer number (4211262006).
Almost surely, 211230032014 is an apocalyptic number.
11230032014 is a deficient number, since it is larger than the sum of its proper divisors (5615016010).
11230032014 is an equidigital number, since it uses as much as digits as its factorization.
11230032014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5615016009.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11230032014 its reverse (41023003211), we get a palindrome (52253035225).
The spelling of 11230032014 in words is "eleven billion, two hundred thirty million, thirty-two thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •