Base | Representation |
---|---|
bin | 110000100000000000110100… |
… | …001011111011110100000000 |
3 | 1000222020212102001020120101102 |
4 | 300200000310023323310000 |
5 | 210424301424110113402 |
6 | 2033355252310553532 |
7 | 62633600532430232 |
oct | 6040006413736400 |
9 | 1028225361216342 |
10 | 213306131332352 |
11 | 61a69693292063 |
12 | 1bb101a79688a8 |
13 | 92038b31059b6 |
14 | 3a961011c6252 |
15 | 199d8ae311102 |
hex | c200342fbd00 |
213306131332352 has 18 divisors (see below), whose sum is σ = 425779035589698. Its totient is φ = 106653065666048.
The previous prime is 213306131332319. The next prime is 213306131332361. The reversal of 213306131332352 is 253233131603312.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 212835886498816 + 470244833536 = 14588896^2 + 685744^2 .
It is a super-2 number, since 2×2133061313323522 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 416613537503 + ... + 416613538014.
Almost surely, 2213306131332352 is an apocalyptic number.
It is an amenable number.
213306131332352 is a deficient number, since it is larger than the sum of its proper divisors (212472904257346).
213306131332352 is an frugal number, since it uses more digits than its factorization.
213306131332352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833227075533 (or 833227075519 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 38.
Adding to 213306131332352 its reverse (253233131603312), we get a palindrome (466539262935664).
The spelling of 213306131332352 in words is "two hundred thirteen trillion, three hundred six billion, one hundred thirty-one million, three hundred thirty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •