Base | Representation |
---|---|
bin | 11001010000110111011101… |
… | …010111110111001011111001 |
3 | 112120102000220110222202220001 |
4 | 121100313131113313023321 |
5 | 104030412214042002223 |
6 | 1032151155355433001 |
7 | 32255306622356665 |
oct | 3120673527671371 |
9 | 476360813882801 |
10 | 111110223000313 |
11 | 32448643278679 |
12 | 10565aa4a55761 |
13 | 49cc859015134 |
14 | 1d61a990198a5 |
15 | cca3729209ad |
hex | 650ddd5f72f9 |
111110223000313 has 32 divisors (see below), whose sum is σ = 114320651028480. Its totient is φ = 107938242310080.
The previous prime is 111110223000299. The next prime is 111110223000323. The reversal of 111110223000313 is 313000322011111.
It is a cyclic number.
It is not a de Polignac number, because 111110223000313 - 29 = 111110222999801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111110223000323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11334303270 + ... + 11334313072.
It is an arithmetic number, because the mean of its divisors is an integer number (3572520344640).
Almost surely, 2111110223000313 is an apocalyptic number.
It is an amenable number.
111110223000313 is a deficient number, since it is larger than the sum of its proper divisors (3210428028167).
111110223000313 is a wasteful number, since it uses less digits than its factorization.
111110223000313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13197.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 111110223000313 its reverse (313000322011111), we get a palindrome (424110545011424).
The spelling of 111110223000313 in words is "one hundred eleven trillion, one hundred ten billion, two hundred twenty-three million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •