Base | Representation |
---|---|
bin | 1100000011010100100… |
… | …10111100100110000110 |
3 | 1110120212100121100201200 |
4 | 12001222102330212012 |
5 | 23241034123241402 |
6 | 514122432403330 |
7 | 41626534504053 |
oct | 6015222744606 |
9 | 1416770540650 |
10 | 414100212102 |
11 | 14a689857455 |
12 | 683093a6546 |
13 | 30084936405 |
14 | 16084ac402a |
15 | ab8972421c |
hex | 606a4bc986 |
414100212102 has 24 divisors (see below), whose sum is σ = 949994604936. Its totient is φ = 129913791936.
The previous prime is 414100212101. The next prime is 414100212107. The reversal of 414100212102 is 201212001414.
414100212102 is a `hidden beast` number, since 41 + 410 + 0 + 2 + 1 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414100212101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 676634028 + ... + 676634639.
It is an arithmetic number, because the mean of its divisors is an integer number (39583108539).
Almost surely, 2414100212102 is an apocalyptic number.
414100212102 is an abundant number, since it is smaller than the sum of its proper divisors (535894392834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414100212102 is a wasteful number, since it uses less digits than its factorization.
414100212102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353268692 (or 1353268689 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 414100212102 its reverse (201212001414), we get a palindrome (615312213516).
The spelling of 414100212102 in words is "four hundred fourteen billion, one hundred million, two hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •