Base | Representation |
---|---|
bin | 11100000100101010… |
… | …110011110000111101 |
3 | 2212210201120020102200 |
4 | 130010222303300331 |
5 | 443213113231023 |
6 | 21503023142113 |
7 | 2114655065613 |
oct | 340452636075 |
9 | 85721506380 |
10 | 30143102013 |
11 | 11868aa4762 |
12 | 5a12a44939 |
13 | 2ac4c1a34b |
14 | 165d4596b3 |
15 | bb6494743 |
hex | 704ab3c3d |
30143102013 has 12 divisors (see below), whose sum is σ = 43988903868. Its totient is φ = 19888231680.
The previous prime is 30143102009. The next prime is 30143102027. The reversal of 30143102013 is 31020134103.
30143102013 is a `hidden beast` number, since 30 + 1 + 431 + 0 + 201 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 7486229529 + 22656872484 = 86523^2 + 150522^2 .
It is not a de Polignac number, because 30143102013 - 22 = 30143102009 is a prime.
It is a super-2 number, since 2×301431020132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30143102053) 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, 17263218 + ... + 17264963.
It is an arithmetic number, because the mean of its divisors is an integer number (3665741989).
Almost surely, 230143102013 is an apocalyptic number.
It is an amenable number.
30143102013 is a deficient number, since it is larger than the sum of its proper divisors (13845801855).
30143102013 is a wasteful number, since it uses less digits than its factorization.
30143102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34528284 (or 34528281 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30143102013 its reverse (31020134103), we get a palindrome (61163236116).
The spelling of 30143102013 in words is "thirty billion, one hundred forty-three million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •