Base | Representation |
---|---|
bin | 11100010101110110… |
… | …010010100001000111 |
3 | 2220112210220102222122 |
4 | 130111312102201013 |
5 | 444310404333411 |
6 | 21551400520155 |
7 | 2125054662620 |
oct | 342566224107 |
9 | 86483812878 |
10 | 30431324231 |
11 | 119a6764340 |
12 | 5a9348005b |
13 | 2b3c853339 |
14 | 1689844a47 |
15 | bd19289db |
hex | 715d92847 |
30431324231 has 16 divisors (see below), whose sum is σ = 37968238080. Its totient is φ = 23695291680.
The previous prime is 30431324197. The next prime is 30431324233. The reversal of 30431324231 is 13242313403.
It is a cyclic number.
It is not a de Polignac number, because 30431324231 - 230 = 29357582407 is a prime.
It is a super-2 number, since 2×304313242312 (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 30431324231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30431324233) 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 15 ways as a sum of consecutive naturals, for example, 39296 + ... + 249813.
It is an arithmetic number, because the mean of its divisors is an integer number (2373014880).
Almost surely, 230431324231 is an apocalyptic number.
30431324231 is a deficient number, since it is larger than the sum of its proper divisors (7536913849).
30431324231 is a wasteful number, since it uses less digits than its factorization.
30431324231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290494.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 30431324231 its reverse (13242313403), we get a palindrome (43673637634).
The spelling of 30431324231 in words is "thirty billion, four hundred thirty-one million, three hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •