Base | Representation |
---|---|
bin | 101111101111000100… |
… | …0100111110111100101 |
3 | 100210121011121220120110 |
4 | 1133132020213313211 |
5 | 3134420312101323 |
6 | 115032023323233 |
7 | 10256214356415 |
oct | 1373610476745 |
9 | 323534556513 |
10 | 102511050213 |
11 | 3a5248a7310 |
12 | 17a4a8b0519 |
13 | 9888b0a780 |
14 | 4d6674a645 |
15 | 29ee8e9793 |
hex | 17de227de5 |
102511050213 has 32 divisors (see below), whose sum is σ = 160904120832. Its totient is φ = 57231921600.
The previous prime is 102511050211. The next prime is 102511050223. The reversal of 102511050213 is 312050115201.
It is not a de Polignac number, because 102511050213 - 21 = 102511050211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102511050213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102511050211) 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 31 ways as a sum of consecutive naturals, for example, 32695 + ... + 453972.
It is an arithmetic number, because the mean of its divisors is an integer number (5028253776).
Almost surely, 2102511050213 is an apocalyptic number.
102511050213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102511050213 is a deficient number, since it is larger than the sum of its proper divisors (58393070619).
102511050213 is a wasteful number, since it uses less digits than its factorization.
102511050213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487185.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 102511050213 its reverse (312050115201), we get a palindrome (414561165414).
The spelling of 102511050213 in words is "one hundred two billion, five hundred eleven million, fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •