Base | Representation |
---|---|
bin | 101100011001110010001… |
… | …010010111011010100011 |
3 | 101210201001021111012100020 |
4 | 230121302022113122203 |
5 | 344443122034201011 |
6 | 10253433414524523 |
7 | 433311046623153 |
oct | 54316212273243 |
9 | 11721037435306 |
10 | 3051342100131 |
11 | a77081081496 |
12 | 413454366743 |
13 | 191981658300 |
14 | a7985986763 |
15 | 5458bd43006 |
hex | 2c6722976a3 |
3051342100131 has 12 divisors (see below), whose sum is σ = 4405488003288. Its totient is φ = 1877748984384.
The previous prime is 3051342100117. The next prime is 3051342100153. The reversal of 3051342100131 is 1310012431503.
3051342100131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3051342100131 - 215 = 3051342067363 is a prime.
It is a super-2 number, since 2×30513421001312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3051342100171) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3009212610 + ... + 3009213623.
It is an arithmetic number, because the mean of its divisors is an integer number (367124000274).
Almost surely, 23051342100131 is an apocalyptic number.
3051342100131 is a deficient number, since it is larger than the sum of its proper divisors (1354145903157).
3051342100131 is a wasteful number, since it uses less digits than its factorization.
3051342100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6018426262 (or 6018426249 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 3051342100131 its reverse (1310012431503), we get a palindrome (4361354531634).
The spelling of 3051342100131 in words is "three trillion, fifty-one billion, three hundred forty-two million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •