Base | Representation |
---|---|
bin | 111010011100110111101010… |
… | …0010001101001111101111011 |
3 | 2111102102102100000212002001211 |
4 | 1310321233110101221331323 |
5 | 1014342142200121003121 |
6 | 5021253113433223551 |
7 | 213203322341431645 |
oct | 16471572421517573 |
9 | 2442372300762054 |
10 | 514141211500411 |
11 | 139904077292800 |
12 | 497b8017561bb7 |
13 | 190b6401199871 |
14 | 90d67d2d9b895 |
15 | 3e68ed5a7ace1 |
hex | 1d39bd4469f7b |
514141211500411 has 24 divisors (see below), whose sum is σ = 583370716178432. Its totient is φ = 452315675631600.
The previous prime is 514141211500303. The next prime is 514141211500457. The reversal of 514141211500411 is 114005112141415.
It is a happy number.
It is not a de Polignac number, because 514141211500411 - 237 = 514003772546939 is a prime.
It is a super-2 number, since 2×5141412115004112 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (514141211500481) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 216930766 + ... + 219288028.
Almost surely, 2514141211500411 is an apocalyptic number.
514141211500411 is a deficient number, since it is larger than the sum of its proper divisors (69229504678021).
514141211500411 is a wasteful number, since it uses less digits than its factorization.
514141211500411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2415463 (or 2415452 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 31.
Adding to 514141211500411 its reverse (114005112141415), we get a palindrome (628146323641826).
The spelling of 514141211500411 in words is "five hundred fourteen trillion, one hundred forty-one billion, two hundred eleven million, five hundred thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •