Base | Representation |
---|---|
bin | 110000100110101111011… |
… | …001001101010101010010 |
3 | 102211022110120000210201110 |
4 | 300212233121031111102 |
5 | 414211042321210002 |
6 | 11034234025114150 |
7 | 463213406224230 |
oct | 60465731152522 |
9 | 12738416023643 |
10 | 3340132210002 |
11 | 10785a6612385 |
12 | 45b40b628956 |
13 | 1b2c85c21723 |
14 | b793ddbd950 |
15 | 5bd40302e6c |
hex | 309af64d552 |
3340132210002 has 64 divisors (see below), whose sum is σ = 7849355673600. Its totient is φ = 927750069696.
The previous prime is 3340132209983. The next prime is 3340132210007. The reversal of 3340132210002 is 2000122310433.
3340132210002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×33401322100022 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (3340132210007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5383938 + ... + 5972189.
It is an arithmetic number, because the mean of its divisors is an integer number (122646182400).
Almost surely, 23340132210002 is an apocalyptic number.
3340132210002 is an abundant number, since it is smaller than the sum of its proper divisors (4509223463598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3340132210002 is a wasteful number, since it uses less digits than its factorization.
3340132210002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11356335.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 3340132210002 its reverse (2000122310433), we get a palindrome (5340254520435).
The spelling of 3340132210002 in words is "three trillion, three hundred forty billion, one hundred thirty-two million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •