Base | Representation |
---|---|
bin | 1101001110010011101111… |
… | …1101001110000010110011 |
3 | 1220110221220200021121220202 |
4 | 3103210323331032002303 |
5 | 3401203313332413021 |
6 | 50531201305425415 |
7 | 3030304424403320 |
oct | 323447375160263 |
9 | 56427820247822 |
10 | 14539470201011 |
11 | 46a6177981318 |
12 | 1769a1b19b26b |
13 | 8160b2467842 |
14 | 3839dd74bb47 |
15 | 1a3311c65a0b |
hex | d393bf4e0b3 |
14539470201011 has 16 divisors (see below), whose sum is σ = 17003196672000. Its totient is φ = 12172416334848.
The previous prime is 14539470201001. The next prime is 14539470201059. The reversal of 14539470201011 is 11010207493541.
It is not a de Polignac number, because 14539470201011 - 210 = 14539470199987 is a prime.
It is a super-2 number, since 2×145394702010112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14539470201001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25571390 + ... + 26133788.
It is an arithmetic number, because the mean of its divisors is an integer number (1062699792000).
Almost surely, 214539470201011 is an apocalyptic number.
14539470201011 is a deficient number, since it is larger than the sum of its proper divisors (2463726470989).
14539470201011 is an equidigital number, since it uses as much as digits as its factorization.
14539470201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648338.
The product of its (nonzero) digits is 30240, while the sum is 38.
Adding to 14539470201011 its reverse (11010207493541), we get a palindrome (25549677694552).
The spelling of 14539470201011 in words is "fourteen trillion, five hundred thirty-nine billion, four hundred seventy million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •