Base | Representation |
---|---|
bin | 1001100100011011101001… |
… | …1110010010110011010110 |
3 | 1101020211211122220110001212 |
4 | 2121012322132102303112 |
5 | 2334341014333131124 |
6 | 34213302325021422 |
7 | 2134103443244342 |
oct | 231067236226326 |
9 | 41224748813055 |
10 | 10521503411414 |
11 | 3397165420806 |
12 | 121b17a254872 |
13 | 5b4234298b78 |
14 | 28535a188622 |
15 | 133a4d7b240e |
hex | 991ba792cd6 |
10521503411414 has 32 divisors (see below), whose sum is σ = 16073812177920. Its totient is φ = 5164267752000.
The previous prime is 10521503411413. The next prime is 10521503411429. The reversal of 10521503411414 is 41411430512501.
It is a super-2 number, since 2×105215034114142 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10521503411411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67302239 + ... + 67458389.
It is an arithmetic number, because the mean of its divisors is an integer number (502306630560).
Almost surely, 210521503411414 is an apocalyptic number.
10521503411414 is a deficient number, since it is larger than the sum of its proper divisors (5552308766506).
10521503411414 is a wasteful number, since it uses less digits than its factorization.
10521503411414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158396.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 10521503411414 its reverse (41411430512501), we get a palindrome (51932933923915).
The spelling of 10521503411414 in words is "ten trillion, five hundred twenty-one billion, five hundred three million, four hundred eleven thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •