Base | Representation |
---|---|
bin | 10000100110101111000… |
… | …011011011000010001001 |
3 | 11001002101110001212122221 |
4 | 100212233003123002021 |
5 | 122143434412242101 |
6 | 2232114322414041 |
7 | 145304413350262 |
oct | 20465703330211 |
9 | 4032343055587 |
10 | 1141103243401 |
11 | 3aaa3703a140 |
12 | 1651a1201321 |
13 | 837b45a5884 |
14 | 3d3303b9969 |
15 | 1ea3925eaa1 |
hex | 109af0db089 |
1141103243401 has 16 divisors (see below), whose sum is σ = 1266721012800. Its totient is φ = 1019154052800.
The previous prime is 1141103243389. The next prime is 1141103243419. The reversal of 1141103243401 is 1043423011411.
It is a cyclic number.
It is not a de Polignac number, because 1141103243401 - 29 = 1141103242889 is a prime.
It is a super-2 number, since 2×11411032434012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1141103243461) 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, 509695 + ... + 1594363.
It is an arithmetic number, because the mean of its divisors is an integer number (79170063300).
Almost surely, 21141103243401 is an apocalyptic number.
1141103243401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1141103243401 is a deficient number, since it is larger than the sum of its proper divisors (125617769399).
1141103243401 is a wasteful number, since it uses less digits than its factorization.
1141103243401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1086360.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1141103243401 its reverse (1043423011411), we get a palindrome (2184526254812).
The spelling of 1141103243401 in words is "one trillion, one hundred forty-one billion, one hundred three million, two hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •