Base | Representation |
---|---|
bin | 1011011000010111… |
… | …1010011010110001 |
3 | 21212220112020200212 |
4 | 2312011322122301 |
5 | 22224040101223 |
6 | 1223051153505 |
7 | 135464046125 |
oct | 26605723261 |
9 | 7786466625 |
10 | 3055003313 |
11 | 132851922a |
12 | 713145895 |
13 | 398c0208b |
14 | 20da43585 |
15 | 12d30b278 |
hex | b617a6b1 |
3055003313 has 8 divisors (see below), whose sum is σ = 3189390336. Its totient is φ = 2920746400.
The previous prime is 3055003297. The next prime is 3055003351. The reversal of 3055003313 is 3133005503.
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 3055003313 - 24 = 3055003297 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3055005313) 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 7 ways as a sum of consecutive naturals, for example, 17093 + ... + 80013.
It is an arithmetic number, because the mean of its divisors is an integer number (398673792).
Almost surely, 23055003313 is an apocalyptic number.
It is an amenable number.
3055003313 is a deficient number, since it is larger than the sum of its proper divisors (134387023).
3055003313 is a wasteful number, since it uses less digits than its factorization.
3055003313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65055.
The product of its (nonzero) digits is 2025, while the sum is 23.
The square root of 3055003313 is about 55272.0843916710. The cubic root of 3055003313 is about 1451.0105223847.
Adding to 3055003313 its reverse (3133005503), we get a palindrome (6188008816).
The spelling of 3055003313 in words is "three billion, fifty-five million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •