Base | Representation |
---|---|
bin | 1001101110010110… |
… | …01111110000011101 |
3 | 111110211121010100000 |
4 | 10313023033300131 |
5 | 41142442143201 |
6 | 2222012524513 |
7 | 243241616541 |
oct | 46713176035 |
9 | 14424533300 |
10 | 5220662301 |
11 | 2239a22948 |
12 | 1018480739 |
13 | 65279b8ba |
14 | 377501a21 |
15 | 2084e2d86 |
hex | 1372cfc1d |
5220662301 has 24 divisors (see below), whose sum is σ = 7850082240. Its totient is φ = 3467165472.
The previous prime is 5220662221. The next prime is 5220662309. The reversal of 5220662301 is 1032660225.
It is not a de Polignac number, because 5220662301 - 226 = 5153553437 is a prime.
It is a super-2 number, since 2×52206623012 = 54510629722165229202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5220662309) 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, 23065 + ... + 104753.
It is an arithmetic number, because the mean of its divisors is an integer number (327086760).
Almost surely, 25220662301 is an apocalyptic number.
It is an amenable number.
5220662301 is a deficient number, since it is larger than the sum of its proper divisors (2629419939).
5220662301 is an equidigital number, since it uses as much as digits as its factorization.
5220662301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81967 (or 81955 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 5220662301 is about 72254.1507527422. The cubic root of 5220662301 is about 1734.7698566635.
The spelling of 5220662301 in words is "five billion, two hundred twenty million, six hundred sixty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •