Base | Representation |
---|---|
bin | 110000010110010001100100… |
… | …011100101011110111000001 |
3 | 1000212212220001222121001200121 |
4 | 300112101210130223313001 |
5 | 210332320411042203044 |
6 | 2032124015541020241 |
7 | 62534340153165535 |
oct | 6026214434536701 |
9 | 1025786058531617 |
10 | 212636926131649 |
11 | 618308a5405a18 |
12 | 1ba225643b4681 |
13 | 91857648b27b6 |
14 | 3a71979addbc5 |
15 | 198b293a2d984 |
hex | c1646472bdc1 |
212636926131649 has 4 divisors (see below), whose sum is σ = 212714276780500. Its totient is φ = 212559575482800.
The previous prime is 212636926131557. The next prime is 212636926131653. The reversal of 212636926131649 is 946131629636212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 127371425951025 + 85265500180624 = 11285895^2 + 9233932^2 .
It is a cyclic number.
It is not a de Polignac number, because 212636926131649 - 27 = 212636926131521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212636926131659) 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, 38675320302 + ... + 38675325799.
It is an arithmetic number, because the mean of its divisors is an integer number (53178569195125).
Almost surely, 2212636926131649 is an apocalyptic number.
It is an amenable number.
212636926131649 is a deficient number, since it is larger than the sum of its proper divisors (77350648851).
212636926131649 is an equidigital number, since it uses as much as digits as its factorization.
212636926131649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77350648850.
The product of its digits is 30233088, while the sum is 61.
The spelling of 212636926131649 in words is "two hundred twelve trillion, six hundred thirty-six billion, nine hundred twenty-six million, one hundred thirty-one thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •