Base | Representation |
---|---|
bin | 100110010100101111001… |
… | …0111101011000110011010 |
3 | 200122112121010211120102002 |
4 | 1030221132113223012122 |
5 | 1142244223032402200 |
6 | 15111420242041002 |
7 | 1052354311136210 |
oct | 114513627530632 |
9 | 20575533746362 |
10 | 5267213169050 |
11 | 17508a3577458 |
12 | 7109a3049162 |
13 | 2c2908361991 |
14 | 142d122c6cb0 |
15 | 9202b7bdbd5 |
hex | 4ca5e5eb19a |
5267213169050 has 48 divisors (see below), whose sum is σ = 11196876836160. Its totient is φ = 1805855439360.
The previous prime is 5267213169017. The next prime is 5267213169067. The reversal of 5267213169050 is 509613127625.
It is a super-3 number, since 3×52672131690503 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5267213168986 and 5267213169004.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 15274637 + ... + 15615663.
It is an arithmetic number, because the mean of its divisors is an integer number (233268267420).
Almost surely, 25267213169050 is an apocalyptic number.
5267213169050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5267213169050 is an abundant number, since it is smaller than the sum of its proper divisors (5929663667110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5267213169050 is a wasteful number, since it uses less digits than its factorization.
5267213169050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385175 (or 385170 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 47.
The spelling of 5267213169050 in words is "five trillion, two hundred sixty-seven billion, two hundred thirteen million, one hundred sixty-nine thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •