Base | Representation |
---|---|
bin | 10000000011100010100… |
… | …001010110111000000001 |
3 | 10220110211201012222012210 |
4 | 100003202201112320001 |
5 | 121034040334214131 |
6 | 2202504325412333 |
7 | 142466046313254 |
oct | 20034241267001 |
9 | 3813751188183 |
10 | 1103312023041 |
11 | 395a03967a18 |
12 | 1599b4b6a0a9 |
13 | 80071009c17 |
14 | 3b5872d309b |
15 | 1da7662b146 |
hex | 100e2856e01 |
1103312023041 has 8 divisors (see below), whose sum is σ = 1486248498784. Its totient is φ = 727958448000.
The previous prime is 1103312023031. The next prime is 1103312023049. The reversal of 1103312023041 is 1403202133011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1103312023041 - 222 = 1103307828737 is a prime.
It is a super-2 number, since 2×11033120230412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1103312022999 and 1103312023017.
It is not an unprimeable number, because it can be changed into a prime (1103312023049) 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, 1895724835 + ... + 1895725416.
It is an arithmetic number, because the mean of its divisors is an integer number (185781062348).
Almost surely, 21103312023041 is an apocalyptic number.
It is an amenable number.
1103312023041 is a deficient number, since it is larger than the sum of its proper divisors (382936475743).
1103312023041 is an equidigital number, since it uses as much as digits as its factorization.
1103312023041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3791450351.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1103312023041 its reverse (1403202133011), we get a palindrome (2506514156052).
The spelling of 1103312023041 in words is "one trillion, one hundred three billion, three hundred twelve million, twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •