Base | Representation |
---|---|
bin | 110100001101011101… |
… | …1101011000010010011 |
3 | 101201101220102221111201 |
4 | 1220122323223002103 |
5 | 3314110434000313 |
6 | 123301354052031 |
7 | 11046314530111 |
oct | 1503273530223 |
9 | 351356387451 |
10 | 112121000083 |
11 | 43606421944 |
12 | 1989111a017 |
13 | a75aa5b441 |
14 | 55d8b78ab1 |
15 | 2db340c0dd |
hex | 1a1aeeb093 |
112121000083 has 2 divisors, whose sum is σ = 112121000084. Its totient is φ = 112121000082.
The previous prime is 112121000053. The next prime is 112121000143. The reversal of 112121000083 is 380000121211.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112121000083 is a prime.
It is a super-3 number, since 3×1121210000833 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 112121000083.
It is not a weakly prime, because it can be changed into another prime (112121000023) 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 as a sum of consecutive naturals, namely, 56060500041 + 56060500042.
It is an arithmetic number, because the mean of its divisors is an integer number (56060500042).
Almost surely, 2112121000083 is an apocalyptic number.
112121000083 is a deficient number, since it is larger than the sum of its proper divisors (1).
112121000083 is an equidigital number, since it uses as much as digits as its factorization.
112121000083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 112121000083 its reverse (380000121211), we get a palindrome (492121121294).
The spelling of 112121000083 in words is "one hundred twelve billion, one hundred twenty-one million, eighty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •