Base | Representation |
---|---|
bin | 110001100100100000100… |
… | …010110010100011011001 |
3 | 110001122122201011111102100 |
4 | 301210200202302203121 |
5 | 421302404443302401 |
6 | 11124523121554013 |
7 | 501052063143102 |
oct | 61444042624331 |
9 | 13048581144370 |
10 | 3406455056601 |
11 | 10a37400896a3 |
12 | 47023aaa5909 |
13 | 1b92c55b445c |
14 | bac324c13a9 |
15 | 5d922bb1b86 |
hex | 319208b28d9 |
3406455056601 has 48 divisors (see below), whose sum is σ = 5189701570560. Its totient is φ = 2149814459520.
The previous prime is 3406455056581. The next prime is 3406455056603. The reversal of 3406455056601 is 1066505546043.
3406455056601 is a `hidden beast` number, since 3 + 40 + 6 + 4 + 550 + 56 + 6 + 0 + 1 = 666.
It is not a de Polignac number, because 3406455056601 - 221 = 3406452959449 is a prime.
It is a super-2 number, since 2×34064550566012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3406455056603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20264640 + ... + 20432046.
It is an arithmetic number, because the mean of its divisors is an integer number (108118782720).
Almost surely, 23406455056601 is an apocalyptic number.
It is an amenable number.
3406455056601 is a deficient number, since it is larger than the sum of its proper divisors (1783246513959).
3406455056601 is a wasteful number, since it uses less digits than its factorization.
3406455056601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168966 (or 168963 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 45.
The spelling of 3406455056601 in words is "three trillion, four hundred six billion, four hundred fifty-five million, fifty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •