Base | Representation |
---|---|
bin | 101011110011010100011… |
… | …000101111000010101011 |
3 | 101122202102212222110122012 |
4 | 223303110120233002223 |
5 | 343304030313024011 |
6 | 10222443215150135 |
7 | 430316414630006 |
oct | 53632430570253 |
9 | 11582385873565 |
10 | 3010040361131 |
11 | a606073486a1 |
12 | 40744851534b |
13 | 18aacb9ac3ab |
14 | a598856453d |
15 | 53470e25a8b |
hex | 2bcd462f0ab |
3010040361131 has 8 divisors (see below), whose sum is σ = 3013863402960. Its totient is φ = 3006217573632.
The previous prime is 3010040361091. The next prime is 3010040361143. The reversal of 3010040361131 is 1311630400103.
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 3010040361131 - 226 = 3009973252267 is a prime.
It is a super-2 number, since 2×30100403611312 (a number of 26 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 = 3010040361097 and 3010040361106.
It is not an unprimeable number, because it can be changed into a prime (3010040361161) 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, 37759091 + ... + 37838723.
It is an arithmetic number, because the mean of its divisors is an integer number (376732925370).
Almost surely, 23010040361131 is an apocalyptic number.
3010040361131 is a deficient number, since it is larger than the sum of its proper divisors (3823041829).
3010040361131 is an equidigital number, since it uses as much as digits as its factorization.
3010040361131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127165.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3010040361131 its reverse (1311630400103), we get a palindrome (4321670761234).
The spelling of 3010040361131 in words is "three trillion, ten billion, forty million, three hundred sixty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •