Base | Representation |
---|---|
bin | 11111001111001100000… |
… | …011000001000101000111 |
3 | 21121012210002020022222002 |
4 | 133033030003001011013 |
5 | 240132230134223443 |
6 | 4322050121255515 |
7 | 311042022100124 |
oct | 37171403010507 |
9 | 7535702208862 |
10 | 2146612023623 |
11 | 758411586161 |
12 | 2a804003459b |
13 | 127569c3a682 |
14 | 75c7a2c374b |
15 | 3ac8942c2b8 |
hex | 1f3cc0c1147 |
2146612023623 has 8 divisors (see below), whose sum is σ = 2240770019040. Its totient is φ = 2054356210080.
The previous prime is 2146612023613. The next prime is 2146612023683. The reversal of 2146612023623 is 3263202166412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2146612023623 - 228 = 2146343588167 is a prime.
It is a super-2 number, since 2×21466120236232 (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 (2146612023613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 475543163 + ... + 475547676.
It is an arithmetic number, because the mean of its divisors is an integer number (280096252380).
Almost surely, 22146612023623 is an apocalyptic number.
2146612023623 is a deficient number, since it is larger than the sum of its proper divisors (94157995417).
2146612023623 is an equidigital number, since it uses as much as digits as its factorization.
2146612023623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951090937.
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 2146612023623 in words is "two trillion, one hundred forty-six billion, six hundred twelve million, twenty-three thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •