Base | Representation |
---|---|
bin | 10000001001111101000… |
… | …100110111010010111001 |
3 | 10221010121202010220210011 |
4 | 100021331010313102321 |
5 | 121142142144130213 |
6 | 2210004022421521 |
7 | 143131535131033 |
oct | 20117504672271 |
9 | 3833552126704 |
10 | 1110199989433 |
11 | 398918a51027 |
12 | 15b1b78918a1 |
13 | 808cb047c92 |
14 | 3ba3c008c53 |
15 | 1dd2b1b503d |
hex | 1027d1374b9 |
1110199989433 has 2 divisors, whose sum is σ = 1110199989434. Its totient is φ = 1110199989432.
The previous prime is 1110199989401. The next prime is 1110199989449. The reversal of 1110199989433 is 3349899910111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 769923767209 + 340276222224 = 877453^2 + 583332^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110199989433 - 25 = 1110199989401 is a prime.
It is a super-2 number, since 2×11101999894332 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110199989233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555099994716 + 555099994717.
It is an arithmetic number, because the mean of its divisors is an integer number (555099994717).
Almost surely, 21110199989433 is an apocalyptic number.
It is an amenable number.
1110199989433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110199989433 is an equidigital number, since it uses as much as digits as its factorization.
1110199989433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1889568, while the sum is 58.
The spelling of 1110199989433 in words is "one trillion, one hundred ten billion, one hundred ninety-nine million, nine hundred eighty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •