Base | Representation |
---|---|
bin | 11100001111011101… |
… | …000000000000101101 |
3 | 2220021100000102002000 |
4 | 130033131000000231 |
5 | 444100423002113 |
6 | 21533005122513 |
7 | 2122313005125 |
oct | 341735000055 |
9 | 86240012060 |
10 | 30324031533 |
11 | 11951141794 |
12 | 5a63559439 |
13 | 2b23558333 |
14 | 16794b5c85 |
15 | bc72d3373 |
hex | 70f74002d |
30324031533 has 16 divisors (see below), whose sum is σ = 45159705600. Its totient is φ = 20110174560.
The previous prime is 30324031523. The next prime is 30324031541. The reversal of 30324031533 is 33513042303.
It is a happy number.
30324031533 is a `hidden beast` number, since 30 + 32 + 40 + 31 + 533 = 666.
It is not a de Polignac number, because 30324031533 - 210 = 30324030509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30324031497 and 30324031506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30324031523) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2934928 + ... + 2945241.
It is an arithmetic number, because the mean of its divisors is an integer number (2822481600).
Almost surely, 230324031533 is an apocalyptic number.
It is an amenable number.
30324031533 is a deficient number, since it is larger than the sum of its proper divisors (14835674067).
30324031533 is a wasteful number, since it uses less digits than its factorization.
30324031533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5880369 (or 5880363 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 27.
Adding to 30324031533 its reverse (33513042303), we get a palindrome (63837073836).
The spelling of 30324031533 in words is "thirty billion, three hundred twenty-four million, thirty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •