Base | Representation |
---|---|
bin | 10000001011000100101… |
… | …100000010100000110011 |
3 | 10221020201110212222221121 |
4 | 100023010230002200303 |
5 | 121202122232110311 |
6 | 2210323142003111 |
7 | 143203364244166 |
oct | 20130454024063 |
9 | 3836643788847 |
10 | 1111401441331 |
11 | 399385159685 |
12 | 15b492116497 |
13 | 80a5cc2a26c |
14 | 3bb137d5add |
15 | 1dd9b8dab71 |
hex | 102c4b02833 |
1111401441331 has 8 divisors (see below), whose sum is σ = 1159737928704. Its totient is φ = 1063066177800.
The previous prime is 1111401441323. The next prime is 1111401441361. The reversal of 1111401441331 is 1331441041111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1111401441331 - 23 = 1111401441323 is a prime.
It is a super-2 number, since 2×11114014413312 (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 = 1111401441296 and 1111401441305.
It is not an unprimeable number, because it can be changed into a prime (1111401441301) 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, 1883100 + ... + 2401846.
It is an arithmetic number, because the mean of its divisors is an integer number (144967241088).
Almost surely, 21111401441331 is an apocalyptic number.
1111401441331 is a deficient number, since it is larger than the sum of its proper divisors (48336487373).
1111401441331 is an equidigital number, since it uses as much as digits as its factorization.
1111401441331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 611921.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 1111401441331 its reverse (1331441041111), we get a palindrome (2442842482442).
The spelling of 1111401441331 in words is "one trillion, one hundred eleven billion, four hundred one million, four hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •