Base | Representation |
---|---|
bin | 11110100111110100110… |
… | …011011111000111000101 |
3 | 21110011200111112020122022 |
4 | 132213310303133013011 |
5 | 233434200103121341 |
6 | 4250420121012525 |
7 | 305014442050625 |
oct | 36476463370705 |
9 | 7404614466568 |
10 | 2104346145221 |
11 | 7414a25a2141 |
12 | 29ba05324145 |
13 | 1235925cbc78 |
14 | 73bcac0a885 |
15 | 39b13a63e4b |
hex | 1e9f4cdf1c5 |
2104346145221 has 4 divisors (see below), whose sum is σ = 2153284427712. Its totient is φ = 2055407862732.
The previous prime is 2104346145169. The next prime is 2104346145247. The reversal of 2104346145221 is 1225416434012.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-2104346145221 is a prime.
It is a super-2 number, since 2×21043461452212 (a number of 25 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 (2104346145271) 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, 24469141181 + ... + 24469141266.
It is an arithmetic number, because the mean of its divisors is an integer number (538321106928).
Almost surely, 22104346145221 is an apocalyptic number.
It is an amenable number.
2104346145221 is a deficient number, since it is larger than the sum of its proper divisors (48938282491).
2104346145221 is an equidigital number, since it uses as much as digits as its factorization.
2104346145221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48938282490.
The product of its (nonzero) digits is 46080, while the sum is 35.
The spelling of 2104346145221 in words is "two trillion, one hundred four billion, three hundred forty-six million, one hundred forty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •