Base | Representation |
---|---|
bin | 1100100011001010… |
… | …0011010011011001 |
3 | 22200202210102210112 |
4 | 3020302203103121 |
5 | 23344341220001 |
6 | 1314134454105 |
7 | 146323302140 |
oct | 31062432331 |
9 | 8622712715 |
10 | 3368695001 |
11 | 14795a4461 |
12 | 7a0204335 |
13 | 418bb4b69 |
14 | 23d57c757 |
15 | 14ab21cbb |
hex | c8ca34d9 |
3368695001 has 4 divisors (see below), whose sum is σ = 3849937152. Its totient is φ = 2887452852.
The previous prime is 3368694997. The next prime is 3368695037. The reversal of 3368695001 is 1005968633.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3368695001 - 22 = 3368694997 is a prime.
It is a super-2 number, since 2×33686950012 = 22696212019524780002, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3368695001.
It is not an unprimeable number, because it can be changed into a prime (3368695051) 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, 240621065 + ... + 240621078.
It is an arithmetic number, because the mean of its divisors is an integer number (962484288).
Almost surely, 23368695001 is an apocalyptic number.
It is an amenable number.
3368695001 is a deficient number, since it is larger than the sum of its proper divisors (481242151).
3368695001 is an equidigital number, since it uses as much as digits as its factorization.
3368695001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481242150.
The product of its (nonzero) digits is 116640, while the sum is 41.
The square root of 3368695001 is about 58040.4600343588. The cubic root of 3368695001 is about 1499.0653438069.
The spelling of 3368695001 in words is "three billion, three hundred sixty-eight million, six hundred ninety-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •