Base | Representation |
---|---|
bin | 1100010110010010011… |
… | …1011010101010111000 |
3 | 202021120111120100110100 |
4 | 3011210213122222320 |
5 | 11433431202430320 |
6 | 241242331315400 |
7 | 21220030406064 |
oct | 3054447325270 |
9 | 667514510410 |
10 | 212141451960 |
11 | 81a72356819 |
12 | 351458abb60 |
13 | 1700a87bb89 |
14 | a3a6800aa4 |
15 | 57b9336790 |
hex | 31649daab8 |
212141451960 has 48 divisors (see below), whose sum is σ = 689459720040. Its totient is φ = 56571053760.
The previous prime is 212141451959. The next prime is 212141451971. The reversal of 212141451960 is 69154141212.
212141451960 is a `hidden beast` number, since 2 + 1 + 2 + 141 + 451 + 9 + 60 = 666.
212141451960 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 294640546 + ... + 294641265.
Almost surely, 2212141451960 is an apocalyptic number.
212141451960 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212141451960 is an abundant number, since it is smaller than the sum of its proper divisors (477318268080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212141451960 is a wasteful number, since it uses less digits than its factorization.
212141451960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589281828 (or 589281821 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 212141451960 in words is "two hundred twelve billion, one hundred forty-one million, four hundred fifty-one thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •