Base | Representation |
---|---|
bin | 10000010101111110101… |
… | …110001100000110001001 |
3 | 10222100221122022111120001 |
4 | 100111332232030012021 |
5 | 121400113300023031 |
6 | 2215541210403001 |
7 | 144066526515154 |
oct | 20257656140611 |
9 | 3870848274501 |
10 | 1123112501641 |
11 | 3a3344800619 |
12 | 161800130461 |
13 | 81ba8267350 |
14 | 3c504cbcc9b |
15 | 1e334ad4861 |
hex | 1057eb8c189 |
1123112501641 has 32 divisors (see below), whose sum is σ = 1318784277888. Its totient is φ = 946972615680.
The previous prime is 1123112501627. The next prime is 1123112501717. The reversal of 1123112501641 is 1461052113211.
It is a happy number.
It is not a de Polignac number, because 1123112501641 - 27 = 1123112501513 is a prime.
It is a super-2 number, since 2×11231125016412 (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 (1123112504641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1115586 + ... + 1868356.
It is an arithmetic number, because the mean of its divisors is an integer number (41212008684).
Almost surely, 21123112501641 is an apocalyptic number.
It is an amenable number.
1123112501641 is a deficient number, since it is larger than the sum of its proper divisors (195671776247).
1123112501641 is a wasteful number, since it uses less digits than its factorization.
1123112501641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753001.
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 1123112501641 its reverse (1461052113211), we get a palindrome (2584164614852).
The spelling of 1123112501641 in words is "one trillion, one hundred twenty-three billion, one hundred twelve million, five hundred one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •