Base | Representation |
---|---|
bin | 10000001001111111100… |
… | …101010010010101000001 |
3 | 10221010201200021110201010 |
4 | 100021333211102111001 |
5 | 121142233430340301 |
6 | 2210012124031133 |
7 | 143132555441544 |
oct | 20117745222501 |
9 | 3833650243633 |
10 | 1110242043201 |
11 | 39893a764705 |
12 | 15b2099924a9 |
13 | 80906980575 |
14 | 3ba4383485b |
15 | 1dd2ec205d6 |
hex | 1027f952541 |
1110242043201 has 4 divisors (see below), whose sum is σ = 1480322724272. Its totient is φ = 740161362132.
The previous prime is 1110242043139. The next prime is 1110242043221. The reversal of 1110242043201 is 1023402420111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1110242043201 - 213 = 1110242035009 is a prime.
It is a super-2 number, since 2×11102420432012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110242043221) 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, 185040340531 + ... + 185040340536.
It is an arithmetic number, because the mean of its divisors is an integer number (370080681068).
Almost surely, 21110242043201 is an apocalyptic number.
It is an amenable number.
1110242043201 is a deficient number, since it is larger than the sum of its proper divisors (370080681071).
1110242043201 is an equidigital number, since it uses as much as digits as its factorization.
1110242043201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370080681070.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1110242043201 its reverse (1023402420111), we get a palindrome (2133644463312).
The spelling of 1110242043201 in words is "one trillion, one hundred ten billion, two hundred forty-two million, forty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •