Base | Representation |
---|---|
bin | 111111000001100100010… |
… | …111110111011000100011 |
3 | 120100001002121022100222010 |
4 | 333001210113313120203 |
5 | 1031424402304342011 |
6 | 13113350004444003 |
7 | 624622330121526 |
oct | 77014427673043 |
9 | 16301077270863 |
10 | 4331011012131 |
11 | 141a853897311 |
12 | 59b4669a9603 |
13 | 2555495b3a5b |
14 | 10d89cca2bbd |
15 | 779d5dec1a6 |
hex | 3f0645f7623 |
4331011012131 has 16 divisors (see below), whose sum is σ = 5790357676800. Its totient is φ = 2879503669728.
The previous prime is 4331011012129. The next prime is 4331011012183. The reversal of 4331011012131 is 1312101101334.
It is not a de Polignac number, because 4331011012131 - 21 = 4331011012129 is a prime.
It is a super-2 number, since 2×43310110121312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4331011012098 and 4331011012107.
It is not an unprimeable number, because it can be changed into a prime (4331011012121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15585850 + ... + 15861296.
It is an arithmetic number, because the mean of its divisors is an integer number (361897354800).
Almost surely, 24331011012131 is an apocalyptic number.
4331011012131 is a deficient number, since it is larger than the sum of its proper divisors (1459346664669).
4331011012131 is a wasteful number, since it uses less digits than its factorization.
4331011012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289658.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 4331011012131 its reverse (1312101101334), we get a palindrome (5643112113465).
The spelling of 4331011012131 in words is "four trillion, three hundred thirty-one billion, eleven million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •