Base | Representation |
---|---|
bin | 1101101001110010110010… |
… | …11001101111111101100001 |
3 | 10221022012102212212122001100 |
4 | 12310321121121233331201 |
5 | 12413400230224240223 |
6 | 143504305020025013 |
7 | 6216053614346505 |
oct | 664713131577541 |
9 | 127265385778040 |
10 | 30023321321313 |
11 | 96259011a7a21 |
12 | 344a879692169 |
13 | 139a257c52b68 |
14 | 75b1ca7dc305 |
15 | 370e9740a043 |
hex | 1b4e5966ff61 |
30023321321313 has 12 divisors (see below), whose sum is σ = 43371431963860. Its totient is φ = 20013511111776.
The previous prime is 30023321321299. The next prime is 30023321321333. The reversal of 30023321321313 is 31312312332003.
30023321321313 is a `hidden beast` number, since 3 + 0 + 0 + 2 + 3 + 3 + 21 + 321 + 313 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 11264998057569 + 18758323263744 = 3356337^2 + 4331088^2 .
It is not a de Polignac number, because 30023321321313 - 26 = 30023321321249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30023321321333) 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, 169609606 + ... + 169786527.
Almost surely, 230023321321313 is an apocalyptic number.
It is an amenable number.
30023321321313 is a deficient number, since it is larger than the sum of its proper divisors (13348110642547).
30023321321313 is a wasteful number, since it uses less digits than its factorization.
30023321321313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339405968 (or 339405965 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 30023321321313 its reverse (31312312332003), we get a palindrome (61335633653316).
The spelling of 30023321321313 in words is "thirty trillion, twenty-three billion, three hundred twenty-one million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •