Base | Representation |
---|---|
bin | 10000001101100111111… |
… | …010111110110010001111 |
3 | 10221111210100001110011001 |
4 | 100031213322332302033 |
5 | 121223224322410211 |
6 | 2211455011441131 |
7 | 143331300056611 |
oct | 20154772766217 |
9 | 3844710043131 |
10 | 1114140044431 |
11 | 39a560011727 |
12 | 15bb172b61a7 |
13 | 810a840b77b |
14 | 3bcd33d6db1 |
15 | 1deac048ac1 |
hex | 10367ebec8f |
1114140044431 has 16 divisors (see below), whose sum is σ = 1169115623424. Its totient is φ = 1059719848704.
The previous prime is 1114140044419. The next prime is 1114140044447. The reversal of 1114140044431 is 1344400414111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1114140044431 - 225 = 1114106489999 is a prime.
It is a super-2 number, since 2×11141400444312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1114140044431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114140044411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4426975 + ... + 4671871.
It is an arithmetic number, because the mean of its divisors is an integer number (73069726464).
Almost surely, 21114140044431 is an apocalyptic number.
1114140044431 is a deficient number, since it is larger than the sum of its proper divisors (54975578993).
1114140044431 is a wasteful number, since it uses less digits than its factorization.
1114140044431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246030.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 1114140044431 its reverse (1344400414111), we get a palindrome (2458540458542).
The spelling of 1114140044431 in words is "one trillion, one hundred fourteen billion, one hundred forty million, forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •