Base | Representation |
---|---|
bin | 110011111001100001… |
… | …1101100001100001011 |
3 | 101122200021121220012022 |
4 | 1213303003230030023 |
5 | 3311223203411243 |
6 | 123111135235055 |
7 | 11023612324310 |
oct | 1476303541413 |
9 | 348607556168 |
10 | 111452013323 |
11 | 432a2835222 |
12 | 19725078a8b |
13 | a68228a2a1 |
14 | 5573d94d07 |
15 | 2d74813b68 |
hex | 19f30ec30b |
111452013323 has 16 divisors (see below), whose sum is σ = 127689031680. Its totient is φ = 95293980576.
The previous prime is 111452013269. The next prime is 111452013331. The reversal of 111452013323 is 323310254111.
It is a cyclic number.
It is not a de Polignac number, because 111452013323 - 220 = 111450964747 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111452013292 and 111452013301.
It is not an unprimeable number, because it can be changed into a prime (111452013373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12009161 + ... + 12018437.
It is an arithmetic number, because the mean of its divisors is an integer number (7980564480).
Almost surely, 2111452013323 is an apocalyptic number.
111452013323 is a deficient number, since it is larger than the sum of its proper divisors (16237018357).
111452013323 is an equidigital number, since it uses as much as digits as its factorization.
111452013323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13346.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 111452013323 its reverse (323310254111), we get a palindrome (434762267434).
The spelling of 111452013323 in words is "one hundred eleven billion, four hundred fifty-two million, thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •