Base | Representation |
---|---|
bin | 1001101101110011… |
… | …11001110110000101 |
3 | 111110112001011010020 |
4 | 10312321321312011 |
5 | 41140311203401 |
6 | 2221331245353 |
7 | 243155153400 |
oct | 46671716605 |
9 | 14415034106 |
10 | 5216116101 |
11 | 22373a8259 |
12 | 1016a49859 |
13 | 651869541 |
14 | 376a7ad37 |
15 | 207de5d36 |
hex | 136e79d85 |
5216116101 has 24 divisors (see below), whose sum is σ = 8135041824. Its totient is φ = 2964155040.
The previous prime is 5216116097. The next prime is 5216116109. The reversal of 5216116101 is 1016116125.
It is not a de Polignac number, because 5216116101 - 22 = 5216116097 is a prime.
It is a super-2 number, since 2×52161161012 = 54415734358222884402, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5216116109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 71415 + ... + 124628.
It is an arithmetic number, because the mean of its divisors is an integer number (338960076).
Almost surely, 25216116101 is an apocalyptic number.
It is an amenable number.
5216116101 is a deficient number, since it is larger than the sum of its proper divisors (2918925723).
5216116101 is a wasteful number, since it uses less digits than its factorization.
5216116101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196241 (or 196234 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 24.
The square root of 5216116101 is about 72222.6841165572. The cubic root of 5216116101 is about 1734.2661593278.
Adding to 5216116101 its sum of digits (24), we get a palindrome (5216116125).
The spelling of 5216116101 in words is "five billion, two hundred sixteen million, one hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •