Base | Representation |
---|---|
bin | 1101000110111001101010… |
… | …1100000000001000010100 |
3 | 1220000210102201201012121002 |
4 | 3101232122230000020110 |
5 | 3342112201342113322 |
6 | 50352513400442432 |
7 | 3015151004002163 |
oct | 321563254001024 |
9 | 56023381635532 |
10 | 14412210504212 |
11 | 4657203116584 |
12 | 1749224179418 |
13 | 8070b121b2c1 |
14 | 37b7aa1a73da |
15 | 19ed64798c92 |
hex | d1b9ab00214 |
14412210504212 has 6 divisors (see below), whose sum is σ = 25221368382378. Its totient is φ = 7206105252104.
The previous prime is 14412210504163. The next prime is 14412210504247. The reversal of 14412210504212 is 21240501221441.
It can be written as a sum of positive squares in only one way, i.e., 7877868016516 + 6534342487696 = 2806754^2 + 2556236^2 .
It is a super-2 number, since 2×144122105042122 (a number of 27 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 (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1801526313023 + ... + 1801526313030.
It is an arithmetic number, because the mean of its divisors is an integer number (4203561397063).
Almost surely, 214412210504212 is an apocalyptic number.
It is an amenable number.
14412210504212 is a deficient number, since it is larger than the sum of its proper divisors (10809157878166).
14412210504212 is a wasteful number, since it uses less digits than its factorization.
14412210504212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3603052626057 (or 3603052626055 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 29.
Adding to 14412210504212 its reverse (21240501221441), we get a palindrome (35652711725653).
The spelling of 14412210504212 in words is "fourteen trillion, four hundred twelve billion, two hundred ten million, five hundred four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •