Base | Representation |
---|---|
bin | 1100011011010000… |
… | …0111110000000001 |
3 | 22121110102121011000 |
4 | 3012310013300001 |
5 | 23312400131001 |
6 | 1310552242213 |
7 | 145441503255 |
oct | 30664076001 |
9 | 8543377130 |
10 | 3335552001 |
11 | 1461917651 |
12 | 7910a0369 |
13 | 41207c412 |
14 | 238dd2265 |
15 | 147c76a86 |
hex | c6d07c01 |
3335552001 has 16 divisors (see below), whose sum is σ = 4943764800. Its totient is φ = 2222708544.
The previous prime is 3335551991. The next prime is 3335552009. The reversal of 3335552001 is 1002555333.
It is not a de Polignac number, because 3335552001 - 214 = 3335535617 is a prime.
It is a super-3 number, since 3×33355520013 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (3335552009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36745 + ... + 89561.
It is an arithmetic number, because the mean of its divisors is an integer number (308985300).
Almost surely, 23335552001 is an apocalyptic number.
It is an amenable number.
3335552001 is a deficient number, since it is larger than the sum of its proper divisors (1608212799).
3335552001 is a wasteful number, since it uses less digits than its factorization.
3335552001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55165 (or 55159 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 27.
The square root of 3335552001 is about 57754.2379483965. The cubic root of 3335552001 is about 1494.1329336078.
The spelling of 3335552001 in words is "three billion, three hundred thirty-five million, five hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •