Base | Representation |
---|---|
bin | 11101111110101111000… |
… | …01101010110100011001 |
3 | 10122110220100112222102100 |
4 | 32333113201222310121 |
5 | 113334132424030241 |
6 | 2105121042554013 |
7 | 134265106655340 |
oct | 16772741526431 |
9 | 3573810488370 |
10 | 1030113111321 |
11 | 367960aa6158 |
12 | 147786968909 |
13 | 761a6c151c8 |
14 | 37c018d6b57 |
15 | 1bbe02849b6 |
hex | efd786ad19 |
1030113111321 has 12 divisors (see below), whose sum is σ = 1700504183872. Its totient is φ = 588636063576.
The previous prime is 1030113111299. The next prime is 1030113111323. The reversal of 1030113111321 is 1231113110301.
1030113111321 is a `hidden beast` number, since 1 + 0 + 30 + 1 + 1 + 311 + 1 + 321 = 666.
It is not a de Polignac number, because 1030113111321 - 25 = 1030113111289 is a prime.
It is a super-2 number, since 2×10301131113212 (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 = 1030113111294 and 1030113111303.
It is not an unprimeable number, because it can be changed into a prime (1030113111323) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8175500821 + ... + 8175500946.
Almost surely, 21030113111321 is an apocalyptic number.
It is an amenable number.
1030113111321 is a deficient number, since it is larger than the sum of its proper divisors (670391072551).
1030113111321 is a wasteful number, since it uses less digits than its factorization.
1030113111321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16351001780 (or 16351001777 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 1030113111321 its reverse (1231113110301), we get a palindrome (2261226221622).
The spelling of 1030113111321 in words is "one trillion, thirty billion, one hundred thirteen million, one hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •