Base | Representation |
---|---|
bin | 110001110110110110001… |
… | …100011011011000101101 |
3 | 110010112110222111002021211 |
4 | 301312312030123120231 |
5 | 422113221241134000 |
6 | 11141541035354421 |
7 | 502350040324456 |
oct | 61666614333055 |
9 | 13115428432254 |
10 | 3426145646125 |
11 | 1101024996a84 |
12 | 4740152b2a11 |
13 | 1bb112b47b67 |
14 | bbb7d66412d |
15 | 5e1c66b07ba |
hex | 31db631b62d |
3426145646125 has 16 divisors (see below), whose sum is σ = 4366804875264. Its totient is φ = 2682599139600.
The previous prime is 3426145646123. The next prime is 3426145646129. The reversal of 3426145646125 is 5216465416243.
It is not a de Polignac number, because 3426145646125 - 21 = 3426145646123 is a prime.
It is a super-2 number, since 2×34261456461252 (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 (3426145646123) 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 15 ways as a sum of consecutive naturals, for example, 291580989 + ... + 291592738.
It is an arithmetic number, because the mean of its divisors is an integer number (272925304704).
Almost surely, 23426145646125 is an apocalyptic number.
It is an amenable number.
3426145646125 is a deficient number, since it is larger than the sum of its proper divisors (940659229139).
3426145646125 is an equidigital number, since it uses as much as digits as its factorization.
3426145646125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583173789 (or 583173779 counting only the distinct ones).
The product of its digits is 4147200, while the sum is 49.
The spelling of 3426145646125 in words is "three trillion, four hundred twenty-six billion, one hundred forty-five million, six hundred forty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •