Base | Representation |
---|---|
bin | 1001000111111000111010… |
… | …0110010011100010100011 |
3 | 1022111222010110121010000212 |
4 | 2101332032212103202203 |
5 | 2303322234101323324 |
6 | 33200124221404335 |
7 | 2053504012005224 |
oct | 221761646234243 |
9 | 38458113533025 |
10 | 10031141042339 |
11 | 321820167504a |
12 | 1160128a096ab |
13 | 579c17a413b1 |
14 | 26971cd1b24b |
15 | 125dedd0d70e |
hex | 91f8e9938a3 |
10031141042339 has 8 divisors (see below), whose sum is σ = 10051596254400. Its totient is φ = 10010690698536.
The previous prime is 10031141042287. The next prime is 10031141042353. The reversal of 10031141042339 is 93324014113001.
10031141042339 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10031141042339 - 216 = 10031140976803 is a prime.
It is a super-2 number, since 2×100311410423392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10031141042639) 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, 2922512 + ... + 5348210.
It is an arithmetic number, because the mean of its divisors is an integer number (1256449531800).
Almost surely, 210031141042339 is an apocalyptic number.
10031141042339 is a deficient number, since it is larger than the sum of its proper divisors (20455212061).
10031141042339 is an equidigital number, since it uses as much as digits as its factorization.
10031141042339 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2434129.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 10031141042339 in words is "ten trillion, thirty-one billion, one hundred forty-one million, forty-two thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •