Base | Representation |
---|---|
bin | 10000100101101101011… |
… | …100000011011010111111 |
3 | 11000222112201122102221102 |
4 | 100211231130003122333 |
5 | 122134211103412111 |
6 | 2231413155523315 |
7 | 145235215360121 |
oct | 20455534033277 |
9 | 4028481572842 |
10 | 1140002404031 |
11 | 3aa521701237 |
12 | 164b345b953b |
13 | 8366a4bcb2a |
14 | 3d2680dd211 |
15 | 1e9c27b013b |
hex | 1096d7036bf |
1140002404031 has 8 divisors (see below), whose sum is σ = 1207071193824. Its totient is φ = 1072934705920.
The previous prime is 1140002404019. The next prime is 1140002404033. The reversal of 1140002404031 is 1304042000411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1140002404031 is a prime.
It is a super-2 number, since 2×11400024040312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1140002403994 and 1140002404012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140002404033) 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, 2995406 + ... + 3354468.
It is an arithmetic number, because the mean of its divisors is an integer number (150883899228).
Almost surely, 21140002404031 is an apocalyptic number.
1140002404031 is a deficient number, since it is larger than the sum of its proper divisors (67068789793).
1140002404031 is a wasteful number, since it uses less digits than its factorization.
1140002404031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545841.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1140002404031 its reverse (1304042000411), we get a palindrome (2444044404442).
The spelling of 1140002404031 in words is "one trillion, one hundred forty billion, two million, four hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •