Base | Representation |
---|---|
bin | 101100010001001101111… |
… | …100000011001111101011 |
3 | 101202211022021110022011220 |
4 | 230101031330003033223 |
5 | 344320302433330011 |
6 | 10245313012553123 |
7 | 432534114012366 |
oct | 54211574031753 |
9 | 11684267408156 |
10 | 3042144433131 |
11 | a73191251101 |
12 | 4117080227a3 |
13 | 190b46c598bb |
14 | a73521d90dd |
15 | 541ee61d506 |
hex | 2c44df033eb |
3042144433131 has 8 divisors (see below), whose sum is σ = 4116732765504. Its totient is φ = 1997826194760.
The previous prime is 3042144433091. The next prime is 3042144433169. The reversal of 3042144433131 is 1313344412403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3042144433131 - 221 = 3042142335979 is a prime.
It is a super-2 number, since 2×30421444331312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3042144433092 and 3042144433101.
It is not an unprimeable number, because it can be changed into a prime (3042144435131) 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, 7567523265 + ... + 7567523666.
It is an arithmetic number, because the mean of its divisors is an integer number (514591595688).
Almost surely, 23042144433131 is an apocalyptic number.
3042144433131 is a deficient number, since it is larger than the sum of its proper divisors (1074588332373).
3042144433131 is a wasteful number, since it uses less digits than its factorization.
3042144433131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15135047001.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 3042144433131 its reverse (1313344412403), we get a palindrome (4355488845534).
The spelling of 3042144433131 in words is "three trillion, forty-two billion, one hundred forty-four million, four hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •