Base | Representation |
---|---|
bin | 101101111010011100110… |
… | …000101100001000010111 |
3 | 102011121221212000212011102 |
4 | 231322130300230020113 |
5 | 403143204304122011 |
6 | 10413241030300315 |
7 | 443644132352552 |
oct | 55723460541027 |
9 | 12147855025142 |
10 | 3155136004631 |
11 | 10070a4025156 |
12 | 42b5a07b769b |
13 | 19b6b3179850 |
14 | ac9d082d699 |
15 | 5711419273b |
hex | 2de9cc2c217 |
3155136004631 has 8 divisors (see below), whose sum is σ = 3399261092640. Its totient is φ = 2911214104992.
The previous prime is 3155136004613. The next prime is 3155136004679. The reversal of 3155136004631 is 1364006315513.
3155136004631 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 3155136004631 - 226 = 3155068895767 is a prime.
It is a super-2 number, since 2×31551360046312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3155136001631) 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, 50764835 + ... + 50826948.
It is an arithmetic number, because the mean of its divisors is an integer number (424907636580).
Almost surely, 23155136004631 is an apocalyptic number.
3155136004631 is a deficient number, since it is larger than the sum of its proper divisors (244125088009).
3155136004631 is a wasteful number, since it uses less digits than its factorization.
3155136004631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101594185.
The product of its (nonzero) digits is 97200, while the sum is 38.
The spelling of 3155136004631 in words is "three trillion, one hundred fifty-five billion, one hundred thirty-six million, four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.534 sec. • engine limits •