Base | Representation |
---|---|
bin | 110000100100110000011111… |
… | …011101111011000001000110 |
3 | 1001000102001001102022011012120 |
4 | 300210300133131323001012 |
5 | 211000122222004200041 |
6 | 2034205140044430410 |
7 | 62666263046060256 |
oct | 6044603735730106 |
9 | 1030361042264176 |
10 | 213632201240646 |
11 | 620849a9247311 |
12 | 1bb63427b48406 |
13 | 9228579013b36 |
14 | 3aa7bd4819966 |
15 | 19a70e5582366 |
hex | c24c1f77b046 |
213632201240646 has 16 divisors (see below), whose sum is σ = 433282210967808. Its totient is φ = 70207765665800.
The previous prime is 213632201240611. The next prime is 213632201240651. The reversal of 213632201240646 is 646042102236312.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 213632201240598 and 213632201240607.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 250742019810 + ... + 250742020661.
It is an arithmetic number, because the mean of its divisors is an integer number (27080138185488).
Almost surely, 2213632201240646 is an apocalyptic number.
213632201240646 is an abundant number, since it is smaller than the sum of its proper divisors (219650009727162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213632201240646 is a wasteful number, since it uses less digits than its factorization.
213632201240646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501484040547.
The product of its (nonzero) digits is 497664, while the sum is 42.
Adding to 213632201240646 its reverse (646042102236312), we get a palindrome (859674303476958).
The spelling of 213632201240646 in words is "two hundred thirteen trillion, six hundred thirty-two billion, two hundred one million, two hundred forty thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •