Base | Representation |
---|---|
bin | 110100010011011010… |
… | …0000100000101011011 |
3 | 101201220210112001122212 |
4 | 1220212310010011123 |
5 | 3320013001111443 |
6 | 123333234305335 |
7 | 11054255033066 |
oct | 1504664040533 |
9 | 351823461585 |
10 | 112320332123 |
11 | 436a8998a6a |
12 | 19927a2824b |
13 | a7901406ac |
14 | 56174258dd |
15 | 2dc5b83618 |
hex | 1a26d0415b |
112320332123 has 4 divisors (see below), whose sum is σ = 117203824848. Its totient is φ = 107436839400.
The previous prime is 112320332119. The next prime is 112320332149. The reversal of 112320332123 is 321233023211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112320332123 - 22 = 112320332119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 4883492701 = 112320332123 / (1 + 1 + 2 + 3 + 2 + 0 + 3 + 3 + 2 + 1 + 2 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112320332323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2441746328 + ... + 2441746373.
It is an arithmetic number, because the mean of its divisors is an integer number (29300956212).
Almost surely, 2112320332123 is an apocalyptic number.
112320332123 is a deficient number, since it is larger than the sum of its proper divisors (4883492725).
112320332123 is an equidigital number, since it uses as much as digits as its factorization.
112320332123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4883492724.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 112320332123 its reverse (321233023211), we get a palindrome (433553355334).
The spelling of 112320332123 in words is "one hundred twelve billion, three hundred twenty million, three hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •