Base | Representation |
---|---|
bin | 110000000010010100010… |
… | …111111111100101001001 |
3 | 102200120112001102002212211 |
4 | 300002110113333211021 |
5 | 413040444143413113 |
6 | 11004245232505121 |
7 | 460330312514326 |
oct | 60022427774511 |
9 | 12616461362784 |
10 | 3301024201033 |
11 | 1062a58116409 |
12 | 4539163ab1a1 |
13 | 1ac3928c0310 |
14 | b5ab0085b4d |
15 | 5ad01cb4b3d |
hex | 300945ff949 |
3301024201033 has 8 divisors (see below), whose sum is σ = 3580524315200. Its totient is φ = 3025177683408.
The previous prime is 3301024201003. The next prime is 3301024201039.
3301024201033 is nontrivially palindromic in base 10.
3301024201033 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3301024201033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3301024200995 and 3301024201013.
It is not an unprimeable number, because it can be changed into a prime (3301024201039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 913397253 + ... + 913400866.
It is an arithmetic number, because the mean of its divisors is an integer number (447565539400).
Almost surely, 23301024201033 is an apocalyptic number.
It is an amenable number.
3301024201033 is a deficient number, since it is larger than the sum of its proper divisors (279500114167).
3301024201033 is a wasteful number, since it uses less digits than its factorization.
3301024201033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1826798271.
The product of its (nonzero) digits is 1296, while the sum is 22.
The spelling of 3301024201033 in words is "three trillion, three hundred one billion, twenty-four million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •