Base | Representation |
---|---|
bin | 11001010110000… |
… | …11100101101000 |
3 | 112211001212212100 |
4 | 30223003211220 |
5 | 413412112410 |
6 | 33033013400 |
7 | 5161120242 |
oct | 1453034550 |
9 | 484055770 |
10 | 212613480 |
11 | aa018722 |
12 | 5b254260 |
13 | 350825c1 |
14 | 20347092 |
15 | 139eb8c0 |
hex | cac3968 |
212613480 has 48 divisors (see below), whose sum is σ = 690994980. Its totient is φ = 56696832.
The previous prime is 212613473. The next prime is 212613481. The reversal of 212613480 is 84316212.
212613480 is a `hidden beast` number, since 2 + 1 + 2 + 613 + 48 + 0 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 198640836 + 13972644 = 14094^2 + 3738^2 .
It is not an unprimeable number, because it can be changed into a prime (212613481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 294937 + ... + 295656.
Almost surely, 2212613480 is an apocalyptic number.
212613480 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212613480 is an abundant number, since it is smaller than the sum of its proper divisors (478381500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212613480 is a wasteful number, since it uses less digits than its factorization.
212613480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590610 (or 590603 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 212613480 is about 14581.2715494911. The cubic root of 212613480 is about 596.8478017449.
Adding to 212613480 its reverse (84316212), we get a palindrome (296929692).
The spelling of 212613480 in words is "two hundred twelve million, six hundred thirteen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •