Base | Representation |
---|---|
bin | 11101011011111001111… |
… | …10001111001001101011 |
3 | 10120200122011212220220012 |
4 | 32231330332033021223 |
5 | 113032333441114311 |
6 | 2052345344122135 |
7 | 133033532121413 |
oct | 16557476171153 |
9 | 3520564786805 |
10 | 1011414004331 |
11 | 35aa35924325 |
12 | 14402860634b |
13 | 744b6bc8b63 |
14 | 36d4a2c5643 |
15 | 1b49883378b |
hex | eb7cf8f26b |
1011414004331 has 8 divisors (see below), whose sum is σ = 1012391292480. Its totient is φ = 1010437186248.
The previous prime is 1011414004319. The next prime is 1011414004369. The reversal of 1011414004331 is 1334004141101.
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 1011414004331 - 238 = 736536097387 is a prime.
It is a super-2 number, since 2×10114140043312 (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 = 1011414004297 and 1011414004306.
It is not an unprimeable number, because it can be changed into a prime (1011414004831) 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, 4266440 + ... + 4497258.
It is an arithmetic number, because the mean of its divisors is an integer number (126548911560).
Almost surely, 21011414004331 is an apocalyptic number.
1011414004331 is a deficient number, since it is larger than the sum of its proper divisors (977288149).
1011414004331 is a wasteful number, since it uses less digits than its factorization.
1011414004331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235033.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1011414004331 its reverse (1334004141101), we get a palindrome (2345418145432).
The spelling of 1011414004331 in words is "one trillion, eleven billion, four hundred fourteen million, four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •