Base | Representation |
---|---|
bin | 110000000010100110100… |
… | …110111010011111010110 |
3 | 102200121022101000111102210 |
4 | 300002212212322133112 |
5 | 413042111001232410 |
6 | 11004335441214250 |
7 | 460341015602466 |
oct | 60024646723726 |
9 | 12617271014383 |
10 | 3301330102230 |
11 | 10630a4860516 |
12 | 4539a0931386 |
13 | 1ac4110a6144 |
14 | b5adc953ba6 |
15 | 5ad1da8c220 |
hex | 300a69ba7d6 |
3301330102230 has 32 divisors (see below), whose sum is σ = 7966966801248. Its totient is φ = 875490854400.
The previous prime is 3301330102211. The next prime is 3301330102261. The reversal of 3301330102230 is 322010331033.
3301330102230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3301330102197 and 3301330102206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 303984451 + ... + 303995310.
It is an arithmetic number, because the mean of its divisors is an integer number (248967712539).
Almost surely, 23301330102230 is an apocalyptic number.
3301330102230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3301330102230 is an abundant number, since it is smaller than the sum of its proper divisors (4665636699018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3301330102230 is a wasteful number, since it uses less digits than its factorization.
3301330102230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607979952.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 3301330102230 its reverse (322010331033), we get a palindrome (3623340433263).
The spelling of 3301330102230 in words is "three trillion, three hundred one billion, three hundred thirty million, one hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •