Base | Representation |
---|---|
bin | 11101111111000111111… |
… | …10100101111111010111 |
3 | 10122111102220122122200100 |
4 | 32333203332211333113 |
5 | 113340044414122221 |
6 | 2105153504345143 |
7 | 134303224446423 |
oct | 16774376457727 |
9 | 3574386578610 |
10 | 1030322020311 |
11 | 367a58a13611 |
12 | 1478249151b3 |
13 | 7620b29b5ac |
14 | 37c21557b83 |
15 | 1bc0379d926 |
hex | efe3fa5fd7 |
1030322020311 has 24 divisors (see below), whose sum is σ = 1538219854080. Its totient is φ = 664167226896.
The previous prime is 1030322020309. The next prime is 1030322020313. The reversal of 1030322020311 is 1130202230301.
1030322020311 is a `hidden beast` number, since 1 + 0 + 30 + 322 + 0 + 2 + 0 + 311 = 666.
It is an interprime number because it is at equal distance from previous prime (1030322020309) and next prime (1030322020313).
It is not a de Polignac number, because 1030322020311 - 21 = 1030322020309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030322020313) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14638081 + ... + 14708298.
It is an arithmetic number, because the mean of its divisors is an integer number (64092493920).
Almost surely, 21030322020311 is an apocalyptic number.
1030322020311 is a deficient number, since it is larger than the sum of its proper divisors (507897833769).
1030322020311 is a wasteful number, since it uses less digits than its factorization.
1030322020311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29346515 (or 29346512 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1030322020311 its reverse (1130202230301), we get a palindrome (2160524250612).
The spelling of 1030322020311 in words is "one trillion, thirty billion, three hundred twenty-two million, twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •