Base | Representation |
---|---|
bin | 110000011110111100011000… |
… | …001000100001100011111000 |
3 | 1000221222211201202001201000120 |
4 | 300132330120020201203320 |
5 | 210422100424413413222 |
6 | 2033301420402133240 |
7 | 62625356516406120 |
oct | 6036743010414370 |
9 | 1027884652051016 |
10 | 213232646232312 |
11 | 61a4050391a823 |
12 | 1bab9ab9951220 |
13 | 91c99a193a995 |
14 | 3a9272d7adc80 |
15 | 199ba0cc8815c |
hex | c1ef182218f8 |
213232646232312 has 64 divisors (see below), whose sum is σ = 609238191302400. Its totient is φ = 60923407288320.
The previous prime is 213232646232283. The next prime is 213232646232323.
213232646232312 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×2132326462323122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51721239 + ... + 55691577.
It is an arithmetic number, because the mean of its divisors is an integer number (9519346739100).
Almost surely, 2213232646232312 is an apocalyptic number.
It is an amenable number.
213232646232312 is an abundant number, since it is smaller than the sum of its proper divisors (396005545070088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213232646232312 is a wasteful number, since it uses less digits than its factorization.
213232646232312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4290036 (or 4290032 counting only the distinct ones).
The product of its digits is 746496, while the sum is 42.
The spelling of 213232646232312 in words is "two hundred thirteen trillion, two hundred thirty-two billion, six hundred forty-six million, two hundred thirty-two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •