Base | Representation |
---|---|
bin | 1100010111010010110… |
… | …1010010000011001111 |
3 | 202022021022120101210220 |
4 | 3011310231102003033 |
5 | 11440004311044400 |
6 | 241325214002423 |
7 | 21226516215321 |
oct | 3056455220317 |
9 | 668238511726 |
10 | 212411424975 |
11 | 820a0791512 |
12 | 352001a6413 |
13 | 17051795619 |
14 | a3d05d9611 |
15 | 57d2db37a0 |
hex | 3174b520cf |
212411424975 has 24 divisors (see below), whose sum is σ = 351334187280. Its totient is φ = 113238577920.
The previous prime is 212411424941. The next prime is 212411424989. The reversal of 212411424975 is 579424114212.
212411424975 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212411424975 - 223 = 212403036367 is a prime.
It is a super-2 number, since 2×2124114249752 (a number of 23 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 (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 413574 + ... + 771923.
It is an arithmetic number, because the mean of its divisors is an integer number (14638924470).
Almost surely, 2212411424975 is an apocalyptic number.
212411424975 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
212411424975 is a deficient number, since it is larger than the sum of its proper divisors (138922762305).
212411424975 is a wasteful number, since it uses less digits than its factorization.
212411424975 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1187899 (or 1187894 counting only the distinct ones).
The product of its digits is 161280, while the sum is 42.
The spelling of 212411424975 in words is "two hundred twelve billion, four hundred eleven million, four hundred twenty-four thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •