Base | Representation |
---|---|
bin | 11100010100100101… |
… | …000010100111010111 |
3 | 2220111022211100112012 |
4 | 130110211002213113 |
5 | 444234431303211 |
6 | 21545320214435 |
7 | 2124405644162 |
oct | 342445024727 |
9 | 86438740465 |
10 | 30410025431 |
11 | 11995737225 |
12 | 5a8830a41b |
13 | 2b383069b6 |
14 | 1686a9cad9 |
15 | bceb1cd8b |
hex | 7149429d7 |
30410025431 has 12 divisors (see below), whose sum is σ = 31037504400. Its totient is φ = 29791447488.
The previous prime is 30410025419. The next prime is 30410025433. The reversal of 30410025431 is 13452001403.
It is not a de Polignac number, because 30410025431 - 218 = 30409763287 is a prime.
It is a super-2 number, since 2×304100254312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30410025397 and 30410025406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30410025433) 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, 1043030 + ... + 1071788.
It is an arithmetic number, because the mean of its divisors is an integer number (2586458700).
Almost surely, 230410025431 is an apocalyptic number.
30410025431 is a deficient number, since it is larger than the sum of its proper divisors (627478969).
30410025431 is an equidigital number, since it uses as much as digits as its factorization.
30410025431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29066 (or 28957 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 30410025431 its reverse (13452001403), we get a palindrome (43862026834).
The spelling of 30410025431 in words is "thirty billion, four hundred ten million, twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •