Base | Representation |
---|---|
bin | 10000000011010010011… |
… | …011101110101110101111 |
3 | 10220110010220100002110112 |
4 | 100003102123232232233 |
5 | 121033012240044211 |
6 | 2202421444330235 |
7 | 142456261154000 |
oct | 20032233565657 |
9 | 3813126302415 |
10 | 1103042112431 |
11 | 3958855750a6 |
12 | 15993a6a397b |
13 | 8002a1159bc |
14 | 3b55d5131a7 |
15 | 1da5cab288b |
hex | 100d26eebaf |
1103042112431 has 32 divisors (see below), whose sum is σ = 1367079120000. Its totient is φ = 886539849216.
The previous prime is 1103042112401. The next prime is 1103042112433. The reversal of 1103042112431 is 1342112403011.
It is not a de Polignac number, because 1103042112431 - 222 = 1103037918127 is a prime.
It is a super-2 number, since 2×11030421124312 (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 = 1103042112397 and 1103042112406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103042112433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1216925 + ... + 1920153.
It is an arithmetic number, because the mean of its divisors is an integer number (42721222500).
Almost surely, 21103042112431 is an apocalyptic number.
1103042112431 is a deficient number, since it is larger than the sum of its proper divisors (264037007569).
1103042112431 is an equidigital number, since it uses as much as digits as its factorization.
1103042112431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703536 (or 703522 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1103042112431 its reverse (1342112403011), we get a palindrome (2445154515442).
The spelling of 1103042112431 in words is "one trillion, one hundred three billion, forty-two million, one hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •