Base | Representation |
---|---|
bin | 10000001100100100110… |
… | …011100111011010100111 |
3 | 10221101212212021111202210 |
4 | 100030210303213122213 |
5 | 121213423043241411 |
6 | 2211151145334503 |
7 | 143261345146542 |
oct | 20144463473247 |
9 | 3841785244683 |
10 | 1113014040231 |
11 | 39a032456045 |
12 | 15b862197433 |
13 | 80c590547b2 |
14 | 3bc27a49859 |
15 | 1de43277ca6 |
hex | 10324ce76a7 |
1113014040231 has 8 divisors (see below), whose sum is σ = 1484129430784. Its totient is φ = 741954004920.
The previous prime is 1113014040217. The next prime is 1113014040317. The reversal of 1113014040231 is 1320404103111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1113014040231 - 25 = 1113014040199 is a prime.
It is a super-2 number, since 2×11130140402312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1113014040198 and 1113014040207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113014040031) 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, 13791871 + ... + 13872336.
It is an arithmetic number, because the mean of its divisors is an integer number (185516178848).
Almost surely, 21113014040231 is an apocalyptic number.
1113014040231 is a deficient number, since it is larger than the sum of its proper divisors (371115390553).
1113014040231 is a wasteful number, since it uses less digits than its factorization.
1113014040231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27677621.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1113014040231 its reverse (1320404103111), we get a palindrome (2433418143342).
The spelling of 1113014040231 in words is "one trillion, one hundred thirteen billion, fourteen million, forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •