Base | Representation |
---|---|
bin | 1111011101111010011010… |
… | …10010001001100000111101 |
3 | 11110102121212101112202001011 |
4 | 13232331031102021200331 |
5 | 13424232404002321341 |
6 | 200201231053115221 |
7 | 10110240245002342 |
oct | 756751522114075 |
9 | 143377771482034 |
10 | 34013142620221 |
11 | a923990319826 |
12 | 3993b84788b11 |
13 | 15c956c02352b |
14 | 85835dd7c7c9 |
15 | 3deb5e9a8b81 |
hex | 1eef4d48983d |
34013142620221 has 4 divisors (see below), whose sum is σ = 34017444277632. Its totient is φ = 34008840962812.
The previous prime is 34013142620213. The next prime is 34013142620257. The reversal of 34013142620221 is 12202624131043.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 34013142620221 - 23 = 34013142620213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34013142623221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2150816845 + ... + 2150832658.
It is an arithmetic number, because the mean of its divisors is an integer number (8504361069408).
Almost surely, 234013142620221 is an apocalyptic number.
It is an amenable number.
34013142620221 is a deficient number, since it is larger than the sum of its proper divisors (4301657411).
34013142620221 is an equidigital number, since it uses as much as digits as its factorization.
34013142620221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4301657410.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 34013142620221 its reverse (12202624131043), we get a palindrome (46215766751264).
The spelling of 34013142620221 in words is "thirty-four trillion, thirteen billion, one hundred forty-two million, six hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •