Base | Representation |
---|---|
bin | 1100011101100011… |
… | …1011100110011011 |
3 | 22122010120211212012 |
4 | 3013120323212123 |
5 | 23322332422223 |
6 | 1311535140135 |
7 | 145616513144 |
oct | 30730734633 |
9 | 8563524765 |
10 | 3345201563 |
11 | 14673084a0 |
12 | 79437464b |
13 | 41407a612 |
14 | 23a3c4acb |
15 | 148a30c78 |
hex | c763b99b |
3345201563 has 8 divisors (see below), whose sum is σ = 3652632576. Its totient is φ = 3038324200.
The previous prime is 3345201557. The next prime is 3345201659. The reversal of 3345201563 is 3651025433.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3345201563 - 26 = 3345201499 is a prime.
It is a super-2 number, since 2×33452015632 = 22380746994195285938, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3345201553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125723 + ... + 149988.
It is an arithmetic number, because the mean of its divisors is an integer number (456579072).
Almost surely, 23345201563 is an apocalyptic number.
3345201563 is a deficient number, since it is larger than the sum of its proper divisors (307431013).
3345201563 is a wasteful number, since it uses less digits than its factorization.
3345201563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276825.
The product of its (nonzero) digits is 32400, while the sum is 32.
The square root of 3345201563 is about 57837.7174774385. The cubic root of 3345201563 is about 1495.5723602709.
Adding to 3345201563 its reverse (3651025433), we get a palindrome (6996226996).
The spelling of 3345201563 in words is "three billion, three hundred forty-five million, two hundred one thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •