Base | Representation |
---|---|
bin | 110010011101110110111… |
… | …000111101101100101001 |
3 | 110021112121012101221110002 |
4 | 302131312320331230221 |
5 | 423310013003032022 |
6 | 11213105324232345 |
7 | 505362045155006 |
oct | 62356670755451 |
9 | 13245535357402 |
10 | 3468033252137 |
11 | 111786a3a5393 |
12 | 48016539b6b5 |
13 | 1c2059cb184c |
14 | bdbd47d08ad |
15 | 60328c58092 |
hex | 32776e3db29 |
3468033252137 has 4 divisors (see below), whose sum is σ = 3468256020180. Its totient is φ = 3467810484096.
The previous prime is 3468033252107. The next prime is 3468033252161. The reversal of 3468033252137 is 7312523308643.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 674334950041 + 2793698302096 = 821179^2 + 1671436^2 .
It is a cyclic number.
It is not a de Polignac number, because 3468033252137 - 226 = 3467966143273 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3468033252091 and 3468033252100.
It is not an unprimeable number, because it can be changed into a prime (3468033252107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111360668 + ... + 111391805.
It is an arithmetic number, because the mean of its divisors is an integer number (867064005045).
Almost surely, 23468033252137 is an apocalyptic number.
It is an amenable number.
3468033252137 is a deficient number, since it is larger than the sum of its proper divisors (222768043).
3468033252137 is a wasteful number, since it uses less digits than its factorization.
3468033252137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222768042.
The product of its (nonzero) digits is 2177280, while the sum is 47.
The spelling of 3468033252137 in words is "three trillion, four hundred sixty-eight billion, thirty-three million, two hundred fifty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •