Base | Representation |
---|---|
bin | 1101101100001001000101… |
… | …11010000000101111101101 |
3 | 10221120220201022111212022212 |
4 | 12312010202322000233231 |
5 | 12421211003410113123 |
6 | 144005331504420205 |
7 | 6224641315653623 |
oct | 666044272005755 |
9 | 127526638455285 |
10 | 30104011410413 |
11 | 96570486a4176 |
12 | 3462438617665 |
13 | 13a4a47036c05 |
14 | 761083091513 |
15 | 37311b28e878 |
hex | 1b6122e80bed |
30104011410413 has 2 divisors, whose sum is σ = 30104011410414. Its totient is φ = 30104011410412.
The previous prime is 30104011410379. The next prime is 30104011410467. The reversal of 30104011410413 is 31401411040103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28133126740489 + 1970884669924 = 5304067^2 + 1403882^2 .
It is a cyclic number.
It is not a de Polignac number, because 30104011410413 - 26 = 30104011410349 is a prime.
It is a super-2 number, since 2×301040114104132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30104011400413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15052005705206 + 15052005705207.
It is an arithmetic number, because the mean of its divisors is an integer number (15052005705207).
Almost surely, 230104011410413 is an apocalyptic number.
It is an amenable number.
30104011410413 is a deficient number, since it is larger than the sum of its proper divisors (1).
30104011410413 is an equidigital number, since it uses as much as digits as its factorization.
30104011410413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 30104011410413 its reverse (31401411040103), we get a palindrome (61505422450516).
The spelling of 30104011410413 in words is "thirty trillion, one hundred four billion, eleven million, four hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •