Base | Representation |
---|---|
bin | 11100100111000111… |
… | …011001110001010111 |
3 | 2221022000000200002000 |
4 | 130213013121301113 |
5 | 1000404040214223 |
6 | 22040230050343 |
7 | 2135203246623 |
oct | 344707316127 |
9 | 87260020060 |
10 | 30721023063 |
11 | 12035242365 |
12 | 5b544a99b3 |
13 | 2b87885473 |
14 | 16b60d6183 |
15 | bec0a0543 |
hex | 7271d9c57 |
30721023063 has 8 divisors (see below), whose sum is σ = 45512626800. Its totient is φ = 20480682024.
The previous prime is 30721023041. The next prime is 30721023079. The reversal of 30721023063 is 36032012703.
It is not a de Polignac number, because 30721023063 - 26 = 30721022999 is a prime.
It is a super-3 number, since 3×307210230633 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1137815669 = 30721023063 / (3 + 0 + 7 + 2 + 1 + 0 + 2 + 3 + 0 + 6 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30721023863) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 568907808 + ... + 568907861.
It is an arithmetic number, because the mean of its divisors is an integer number (5689078350).
Almost surely, 230721023063 is an apocalyptic number.
30721023063 is a deficient number, since it is larger than the sum of its proper divisors (14791603737).
30721023063 is a wasteful number, since it uses less digits than its factorization.
30721023063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1137815678 (or 1137815672 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 27.
Adding to 30721023063 its reverse (36032012703), we get a palindrome (66753035766).
The spelling of 30721023063 in words is "thirty billion, seven hundred twenty-one million, twenty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •