Base | Representation |
---|---|
bin | 11100001001011100… |
… | …001011000110101011 |
3 | 2220000022012011201122 |
4 | 130021130023012223 |
5 | 443344111322111 |
6 | 21515003005455 |
7 | 2116646356256 |
oct | 341134130653 |
9 | 86008164648 |
10 | 30223151531 |
11 | 118aa1aa091 |
12 | 5a3580988b |
13 | 2b08697121 |
14 | 1669d3609d |
15 | bbd507cdb |
hex | 70970b1ab |
30223151531 has 12 divisors (see below), whose sum is σ = 33212659920. Its totient is φ = 27464438400.
The previous prime is 30223151509. The next prime is 30223151533. The reversal of 30223151531 is 13515132203.
It is a de Polignac number, because none of the positive numbers 2k-30223151531 is a prime.
It is a super-2 number, since 2×302231515312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30223151531.
It is not an unprimeable number, because it can be changed into a prime (30223151533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1794695 + ... + 1811456.
It is an arithmetic number, because the mean of its divisors is an integer number (2767721660).
Almost surely, 230223151531 is an apocalyptic number.
30223151531 is a deficient number, since it is larger than the sum of its proper divisors (2989508389).
30223151531 is a wasteful number, since it uses less digits than its factorization.
30223151531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3606214 (or 3606197 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 30223151531 its reverse (13515132203), we get a palindrome (43738283734).
The spelling of 30223151531 in words is "thirty billion, two hundred twenty-three million, one hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •