Base | Representation |
---|---|
bin | 1001101101100100… |
… | …11011011000001101 |
3 | 111110101100120210001 |
4 | 10312302123120031 |
5 | 41134311000201 |
6 | 2221221244301 |
7 | 243132411604 |
oct | 46662333015 |
9 | 14411316701 |
10 | 5214156301 |
11 | 2236289892 |
12 | 1016263691 |
13 | 6513314b3 |
14 | 3766caa3b |
15 | 207b5a301 |
hex | 136c9b60d |
5214156301 has 8 divisors (see below), whose sum is σ = 5495987520. Its totient is φ = 4933065312.
The previous prime is 5214156229. The next prime is 5214156349. The reversal of 5214156301 is 1036514125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5214156301 - 219 = 5213632013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5214156301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5214156361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170560 + ... + 198793.
It is an arithmetic number, because the mean of its divisors is an integer number (686998440).
Almost surely, 25214156301 is an apocalyptic number.
It is an amenable number.
5214156301 is a deficient number, since it is larger than the sum of its proper divisors (281831219).
5214156301 is a wasteful number, since it uses less digits than its factorization.
5214156301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370115.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 5214156301 is about 72209.1150825157. The cubic root of 5214156301 is about 1734.0489325311.
The spelling of 5214156301 in words is "five billion, two hundred fourteen million, one hundred fifty-six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •