Base | Representation |
---|---|
bin | 11100001000001001… |
… | …010100010100011001 |
3 | 2212221210022200012102 |
4 | 130020021110110121 |
5 | 443323031300241 |
6 | 21512505253145 |
7 | 2116263634115 |
oct | 341011242431 |
9 | 85853280172 |
10 | 30201431321 |
11 | 11898a143a6 |
12 | 5a2a4941b5 |
13 | 2b04030a29 |
14 | 16670c0745 |
15 | bbb66739b |
hex | 708254519 |
30201431321 has 12 divisors (see below), whose sum is σ = 30664932480. Its totient is φ = 29740156680.
The previous prime is 30201431317. The next prime is 30201431339. The reversal of 30201431321 is 12313410203.
It is not a de Polignac number, because 30201431321 - 22 = 30201431317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30201431293 and 30201431302.
It is not an unprimeable number, because it can be changed into a prime (30201431371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19986956 + ... + 19988466.
It is an arithmetic number, because the mean of its divisors is an integer number (2555411040).
Almost surely, 230201431321 is an apocalyptic number.
It is an amenable number.
30201431321 is a deficient number, since it is larger than the sum of its proper divisors (463501159).
30201431321 is an frugal number, since it uses more digits than its factorization.
30201431321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2596 (or 2093 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30201431321 its reverse (12313410203), we get a palindrome (42514841524).
It can be divided in two parts, 3020 and 1431321, that added together give a palindrome (1434341).
The spelling of 30201431321 in words is "thirty billion, two hundred one million, four hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •