Base | Representation |
---|---|
bin | 100110110000100010011… |
… | …1100101001011110001011 |
3 | 200212020200221121121001011 |
4 | 1031201010330221132023 |
5 | 1144234011021234420 |
6 | 15155052421104351 |
7 | 1056566643403024 |
oct | 115410474513613 |
9 | 20766627547034 |
10 | 5326916196235 |
11 | 1774150358437 |
12 | 7204855580b7 |
13 | 2c8431410bba |
14 | 145b77553c4b |
15 | 93872e0e95a |
hex | 4d844f2978b |
5326916196235 has 16 divisors (see below), whose sum is σ = 6411984076800. Its totient is φ = 4248414704736.
The previous prime is 5326916196233. The next prime is 5326916196257.
5326916196235 is nontrivially palindromic in base 10.
5326916196235 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 5326916196235 - 21 = 5326916196233 is a prime.
It is a super-2 number, since 2×53269161962352 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5326916196235.
It is not an unprimeable number, because it can be changed into a prime (5326916196233) 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, 8581576 + ... + 9181354.
It is an arithmetic number, because the mean of its divisors is an integer number (400749004800).
Almost surely, 25326916196235 is an apocalyptic number.
5326916196235 is a deficient number, since it is larger than the sum of its proper divisors (1085067880565).
5326916196235 is a wasteful number, since it uses less digits than its factorization.
5326916196235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605250.
The product of its digits is 15746400, while the sum is 58.
The spelling of 5326916196235 in words is "five trillion, three hundred twenty-six billion, nine hundred sixteen million, one hundred ninety-six thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •