Base | Representation |
---|---|
bin | 1101010010011011011000… |
… | …1111000001110100011101 |
3 | 1220201201120211100011210012 |
4 | 3110212312033001310131 |
5 | 3403333233214312441 |
6 | 51023504021053005 |
7 | 3035361252602162 |
oct | 324466617016435 |
9 | 56651524304705 |
10 | 14610241166621 |
11 | 4723194283251 |
12 | 177b690257165 |
13 | 81c98053a759 |
14 | 3871d48d2069 |
15 | 1a50a4db59eb |
hex | d49b63c1d1d |
14610241166621 has 4 divisors (see below), whose sum is σ = 14610497332512. Its totient is φ = 14609985000732.
The previous prime is 14610241166603. The next prime is 14610241166723. The reversal of 14610241166621 is 12666114201641.
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-14610241166621 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 (14610241166021) 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 3 ways as a sum of consecutive naturals, for example, 127997375 + ... + 128111468.
It is an arithmetic number, because the mean of its divisors is an integer number (3652624333128).
Almost surely, 214610241166621 is an apocalyptic number.
It is an amenable number.
14610241166621 is a deficient number, since it is larger than the sum of its proper divisors (256165891).
14610241166621 is an equidigital number, since it uses as much as digits as its factorization.
14610241166621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256165890.
The product of its (nonzero) digits is 82944, while the sum is 41.
The spelling of 14610241166621 in words is "fourteen trillion, six hundred ten billion, two hundred forty-one million, one hundred sixty-six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •