Base | Representation |
---|---|
bin | 11101001011001000101… |
… | …11101011111110110111 |
3 | 10112211101202201201101000 |
4 | 32211210113223332313 |
5 | 112410414243423111 |
6 | 2044300145134343 |
7 | 132264454362234 |
oct | 16454427537667 |
9 | 3484352651330 |
10 | 1002411311031 |
11 | 357136063629 |
12 | 14233562a3b3 |
13 | 736b0a149c0 |
14 | 367347ac78b |
15 | 1b11d2c3c56 |
hex | e9645ebfb7 |
1002411311031 has 32 divisors (see below), whose sum is σ = 1607325440000. Its totient is φ = 613768614624.
The previous prime is 1002411310991. The next prime is 1002411311087. The reversal of 1002411311031 is 1301131142001.
It is a happy number.
It is not a de Polignac number, because 1002411311031 - 219 = 1002410786743 is a prime.
It is a super-2 number, since 2×10024113110312 (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 = 1002411310995 and 1002411311013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002411310031) 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, 7105711 + ... + 7245408.
It is an arithmetic number, because the mean of its divisors is an integer number (50228920000).
Almost surely, 21002411311031 is an apocalyptic number.
1002411311031 is a deficient number, since it is larger than the sum of its proper divisors (604914128969).
1002411311031 is a wasteful number, since it uses less digits than its factorization.
1002411311031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14351340 (or 14351334 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1002411311031 its reverse (1301131142001), we get a palindrome (2303542453032).
The spelling of 1002411311031 in words is "one trillion, two billion, four hundred eleven million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •