Base | Representation |
---|---|
bin | 10000001101100000001… |
… | …100001000010010110101 |
3 | 10221111110021221212120022 |
4 | 100031200030020102311 |
5 | 121222443120301401 |
6 | 2211434055214525 |
7 | 143325133333445 |
oct | 20154014102265 |
9 | 3844407855508 |
10 | 1114010322101 |
11 | 39a4a386a396 |
12 | 15ba9b977445 |
13 | 8108758c4b1 |
14 | 3bcc00aa125 |
15 | 1dea097271b |
hex | 103603084b5 |
1114010322101 has 8 divisors (see below), whose sum is σ = 1115405847360. Its totient is φ = 1112614959808.
The previous prime is 1114010322077. The next prime is 1114010322119. The reversal of 1114010322101 is 1012230104111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1114010322101 - 26 = 1114010322037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1114010322101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114010321101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19316030 + ... + 19373616.
It is an arithmetic number, because the mean of its divisors is an integer number (139425730920).
Almost surely, 21114010322101 is an apocalyptic number.
It is an amenable number.
1114010322101 is a deficient number, since it is larger than the sum of its proper divisors (1395525259).
1114010322101 is an equidigital number, since it uses as much as digits as its factorization.
1114010322101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81483.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1114010322101 its reverse (1012230104111), we get a palindrome (2126240426212).
The spelling of 1114010322101 in words is "one trillion, one hundred fourteen billion, ten million, three hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •