Base | Representation |
---|---|
bin | 100110000000011101001001… |
… | …1100111101011110110000010 |
3 | 1121211201010020022010100002210 |
4 | 1030000322103213223312002 |
5 | 322304400330101240002 |
6 | 3143005443550122550 |
7 | 130263254033024664 |
oct | 11400722347536602 |
9 | 1554633208110083 |
10 | 334314141040002 |
11 | 9758291607a062 |
12 | 315b43a14b0456 |
13 | 114708c405ca86 |
14 | 5c7ac68372534 |
15 | 289b42849496c |
hex | 1300e939ebd82 |
334314141040002 has 32 divisors (see below), whose sum is σ = 669573865239552. Its totient is φ = 111280461670224.
The previous prime is 334314141040001. The next prime is 334314141040091. The reversal of 334314141040002 is 200040141413433.
It is a super-2 number, since 2×3343141410400022 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (334314141040001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 112410883 + ... + 115346585.
It is an arithmetic number, because the mean of its divisors is an integer number (20924183288736).
Almost surely, 2334314141040002 is an apocalyptic number.
334314141040002 is an abundant number, since it is smaller than the sum of its proper divisors (335259724199550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
334314141040002 is a wasteful number, since it uses less digits than its factorization.
334314141040002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2962542.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 334314141040002 its reverse (200040141413433), we get a palindrome (534354282453435).
The spelling of 334314141040002 in words is "three hundred thirty-four trillion, three hundred fourteen billion, one hundred forty-one million, forty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •