Base | Representation |
---|---|
bin | 110000010110101010110101… |
… | …010100001001100111010110 |
3 | 1000212222111002110221002201010 |
4 | 300112222311110021213112 |
5 | 210333241434434340002 |
6 | 2032144303404313050 |
7 | 62536320321622263 |
oct | 6026526524114726 |
9 | 1025874073832633 |
10 | 212664052652502 |
11 | 618413556445a0 |
12 | 1ba27874b42786 |
13 | 9188198861379 |
14 | 3a72dd067826a |
15 | 198bd3025646c |
hex | c16ab55099d6 |
212664052652502 has 32 divisors (see below), whose sum is σ = 467647795113984. Its totient is φ = 63936221983200.
The previous prime is 212664052652479. The next prime is 212664052652609. The reversal of 212664052652502 is 205256250466212.
It is a super-2 number, since 2×2126640526525022 (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 (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12685749949 + ... + 12685766712.
It is an arithmetic number, because the mean of its divisors is an integer number (14613993597312).
Almost surely, 2212664052652502 is an apocalyptic number.
212664052652502 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212664052652502 is an abundant number, since it is smaller than the sum of its proper divisors (254983742461482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212664052652502 is a wasteful number, since it uses less digits than its factorization.
212664052652502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25371516804.
The product of its (nonzero) digits is 3456000, while the sum is 48.
The spelling of 212664052652502 in words is "two hundred twelve trillion, six hundred sixty-four billion, fifty-two million, six hundred fifty-two thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •