Base | Representation |
---|---|
bin | 110000101100011010101… |
… | …100000111101011101001 |
3 | 102211220012100000022020101 |
4 | 300230122230013223221 |
5 | 414311033142001001 |
6 | 11041122520025401 |
7 | 463520426503201 |
oct | 60543254075351 |
9 | 12756170008211 |
10 | 3346227297001 |
11 | 1080144089466 |
12 | 460630902261 |
13 | 1b3717900994 |
14 | b7d5b6a1401 |
15 | 5c09a46ea01 |
hex | 30b1ab07ae9 |
3346227297001 has 2 divisors, whose sum is σ = 3346227297002. Its totient is φ = 3346227297000.
The previous prime is 3346227296987. The next prime is 3346227297053. The reversal of 3346227297001 is 1007927226433.
It is a happy number.
3346227297001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2485273425625 + 860953871376 = 1576475^2 + 927876^2 .
It is a cyclic number.
It is not a de Polignac number, because 3346227297001 - 211 = 3346227294953 is a prime.
It is a super-2 number, since 2×33462272970012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3346227297601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1673113648500 + 1673113648501.
It is an arithmetic number, because the mean of its divisors is an integer number (1673113648501).
Almost surely, 23346227297001 is an apocalyptic number.
It is an amenable number.
3346227297001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3346227297001 is an equidigital number, since it uses as much as digits as its factorization.
3346227297001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 762048, while the sum is 46.
The spelling of 3346227297001 in words is "three trillion, three hundred forty-six billion, two hundred twenty-seven million, two hundred ninety-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •