Base | Representation |
---|---|
bin | 10000001101100101110… |
… | …010101101110101001001 |
3 | 10221111200211211122002221 |
4 | 100031211302231311021 |
5 | 121223141201322101 |
6 | 2211451254054041 |
7 | 143330354332636 |
oct | 20154562556511 |
9 | 3844624748087 |
10 | 1114104323401 |
11 | 39a541933a13 |
12 | 15bb0734a321 |
13 | 810a0bb2774 |
14 | 3bccc77918d |
15 | 1dea8d3eaa1 |
hex | 10365cadd49 |
1114104323401 has 4 divisors (see below), whose sum is σ = 1116035180692. Its totient is φ = 1112173466112.
The previous prime is 1114104323359. The next prime is 1114104323413. The reversal of 1114104323401 is 1043234014111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 993014243001 + 121090080400 = 996501^2 + 347980^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114104323401 - 231 = 1111956839753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1114104323461) 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, 965427780 + ... + 965428933.
It is an arithmetic number, because the mean of its divisors is an integer number (279008795173).
Almost surely, 21114104323401 is an apocalyptic number.
It is an amenable number.
1114104323401 is a deficient number, since it is larger than the sum of its proper divisors (1930857291).
1114104323401 is an equidigital number, since it uses as much as digits as its factorization.
1114104323401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1930857290.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1114104323401 its reverse (1043234014111), we get a palindrome (2157338337512).
The spelling of 1114104323401 in words is "one trillion, one hundred fourteen billion, one hundred four million, three hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •