Base | Representation |
---|---|
bin | 11100001000110101… |
… | …111000010111110011 |
3 | 2212222121022011220110 |
4 | 130020311320113303 |
5 | 443334024111311 |
6 | 21514003512403 |
7 | 2116465140342 |
oct | 341065702763 |
9 | 85877264813 |
10 | 30213113331 |
11 | 118a4573255 |
12 | 5a32388703 |
13 | 2b0659106b |
14 | 1668881b59 |
15 | bbc6c38a6 |
hex | 708d785f3 |
30213113331 has 8 divisors (see below), whose sum is σ = 40285186704. Its totient is φ = 20141557760.
The previous prime is 30213113317. The next prime is 30213113341. The reversal of 30213113331 is 13331131203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30213113331 - 227 = 30078895603 is a prime.
It is a super-2 number, since 2×302131133312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30213113298 and 30213113307.
It is not an unprimeable number, because it can be changed into a prime (30213113341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37435 + ... + 248651.
It is an arithmetic number, because the mean of its divisors is an integer number (5035648338).
Almost surely, 230213113331 is an apocalyptic number.
30213113331 is a deficient number, since it is larger than the sum of its proper divisors (10072073373).
30213113331 is a wasteful number, since it uses less digits than its factorization.
30213113331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258901.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 30213113331 its reverse (13331131203), we get a palindrome (43544244534).
The spelling of 30213113331 in words is "thirty billion, two hundred thirteen million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •