Base | Representation |
---|---|
bin | 1111100011101100110100… |
… | …10000100110010001111101 |
3 | 11111010122011021121010001221 |
4 | 13301312122100212101331 |
5 | 13441012140123230010 |
6 | 200432435455433341 |
7 | 10130510213364142 |
oct | 761663220462175 |
9 | 144118137533057 |
10 | 34212002555005 |
11 | a9a02575a0070 |
12 | 3a06622525851 |
13 | 16122410a45b2 |
14 | 863c268923c9 |
15 | 3e4deccd0dda |
hex | 1f1d9a42647d |
34212002555005 has 8 divisors (see below), whose sum is σ = 44786621526624. Its totient is φ = 24881456403600.
The previous prime is 34212002554997. The next prime is 34212002555009. The reversal of 34212002555005 is 50055520021243.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 34212002555005 - 23 = 34212002554997 is a prime.
It is a super-2 number, since 2×342120025550052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34212002555009) 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, 311018204991 + ... + 311018205100.
It is an arithmetic number, because the mean of its divisors is an integer number (5598327690828).
Almost surely, 234212002555005 is an apocalyptic number.
It is an amenable number.
34212002555005 is a deficient number, since it is larger than the sum of its proper divisors (10574618971619).
34212002555005 is a wasteful number, since it uses less digits than its factorization.
34212002555005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 622036410107.
The product of its (nonzero) digits is 60000, while the sum is 34.
Adding to 34212002555005 its reverse (50055520021243), we get a palindrome (84267522576248).
The spelling of 34212002555005 in words is "thirty-four trillion, two hundred twelve billion, two million, five hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •