Base | Representation |
---|---|
bin | 101101110010000101010… |
… | …011011001101100111101 |
3 | 102010202202210000101001120 |
4 | 231302011103121230331 |
5 | 403021310021011123 |
6 | 10405153355101153 |
7 | 443205410102034 |
oct | 55620523315475 |
9 | 12122683011046 |
10 | 3146152516413 |
11 | 1003304091525 |
12 | 4298b41417b9 |
13 | 19a8b0c5b04a |
14 | ac3bb6b571b |
15 | 56c8a6782e3 |
hex | 2dc854d9b3d |
3146152516413 has 32 divisors (see below), whose sum is σ = 4328134981632. Its totient is φ = 2031635424000.
The previous prime is 3146152516399. The next prime is 3146152516477.
3146152516413 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 3146152516413 - 213 = 3146152508221 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3146152516313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25066213 + ... + 25191413.
It is an arithmetic number, because the mean of its divisors is an integer number (135254218176).
Almost surely, 23146152516413 is an apocalyptic number.
It is an amenable number.
3146152516413 is a deficient number, since it is larger than the sum of its proper divisors (1181982465219).
3146152516413 is a wasteful number, since it uses less digits than its factorization.
3146152516413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126865.
The product of its digits is 259200, while the sum is 42.
The spelling of 3146152516413 in words is "three trillion, one hundred forty-six billion, one hundred fifty-two million, five hundred sixteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •