Base | Representation |
---|---|
bin | 1110001100111011001110… |
… | …11011010100100001011011 |
3 | 11002120121020020012021000222 |
4 | 13012131213123110201123 |
5 | 13043134421230040121 |
6 | 150231022302350255 |
7 | 6402216322416206 |
oct | 706354733244133 |
9 | 132517206167028 |
10 | 31230442424411 |
11 | 9a5083563318a |
12 | 3604803b8b38b |
13 | 1457030965829 |
14 | 79d7c09a893d |
15 | 3925973820ab |
hex | 1c67676d485b |
31230442424411 has 8 divisors (see below), whose sum is σ = 31552911196800. Its totient is φ = 30907983967488.
The previous prime is 31230442424371. The next prime is 31230442424413. The reversal of 31230442424411 is 11442424403213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31230442424411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31230442424413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3583085 + ... + 8677521.
It is an arithmetic number, because the mean of its divisors is an integer number (3944113899600).
Almost surely, 231230442424411 is an apocalyptic number.
31230442424411 is a deficient number, since it is larger than the sum of its proper divisors (322468772389).
31230442424411 is an equidigital number, since it uses as much as digits as its factorization.
31230442424411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5157733.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 31230442424411 its reverse (11442424403213), we get a palindrome (42672866827624).
It can be divided in two parts, 3123044 and 2424411, that added together give a palindrome (5547455).
The spelling of 31230442424411 in words is "thirty-one trillion, two hundred thirty billion, four hundred forty-two million, four hundred twenty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •