Base | Representation |
---|---|
bin | 11001010010100111000000… |
… | …101100110010001111100111 |
3 | 112120211111002000111010112012 |
4 | 121102213000230302033213 |
5 | 104034343020230430434 |
6 | 1032322205042344435 |
7 | 32300050055001656 |
oct | 3122470054621747 |
9 | 476744060433465 |
10 | 111230001030119 |
11 | 32494418904254 |
12 | 1058515235b11b |
13 | 4a0ac3722209a |
14 | 1d677bcaa119d |
15 | ccd53317c3ce |
hex | 6529c0b323e7 |
111230001030119 has 2 divisors, whose sum is σ = 111230001030120. Its totient is φ = 111230001030118.
The previous prime is 111230001030103. The next prime is 111230001030133. The reversal of 111230001030119 is 911030100032111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111230001030119 - 24 = 111230001030103 is a prime.
It is a super-2 number, since 2×1112300010301192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111230001030094 and 111230001030103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111230001030719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55615000515059 + 55615000515060.
It is an arithmetic number, because the mean of its divisors is an integer number (55615000515060).
Almost surely, 2111230001030119 is an apocalyptic number.
111230001030119 is a deficient number, since it is larger than the sum of its proper divisors (1).
111230001030119 is an equidigital number, since it uses as much as digits as its factorization.
111230001030119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 111230001030119 in words is "one hundred eleven trillion, two hundred thirty billion, one million, thirty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •