Base | Representation |
---|---|
bin | 10000010110010000101… |
… | …100011110001101000101 |
3 | 10222101201122201022100202 |
4 | 100112100230132031011 |
5 | 121401222443311123 |
6 | 2220031141420245 |
7 | 144110150536646 |
oct | 20262054361505 |
9 | 3871648638322 |
10 | 1123414041413 |
11 | 3a3489a36944 |
12 | 16188510a685 |
13 | 81c25883c51 |
14 | 3c532d736cd |
15 | 1e3512e9a28 |
hex | 10590b1e345 |
1123414041413 has 8 divisors (see below), whose sum is σ = 1127943208800. Its totient is φ = 1118887488688.
The previous prime is 1123414041361. The next prime is 1123414041427. The reversal of 1123414041413 is 3141404143211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1123414041413 - 240 = 23902413637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123414031413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 209678 + ... + 1513536.
It is an arithmetic number, because the mean of its divisors is an integer number (140992901100).
Almost surely, 21123414041413 is an apocalyptic number.
It is an amenable number.
1123414041413 is a deficient number, since it is larger than the sum of its proper divisors (4529167387).
1123414041413 is a wasteful number, since it uses less digits than its factorization.
1123414041413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1307331.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 1123414041413 its reverse (3141404143211), we get a palindrome (4264818184624).
The spelling of 1123414041413 in words is "one trillion, one hundred twenty-three billion, four hundred fourteen million, forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.952 sec. • engine limits •