Base | Representation |
---|---|
bin | 1001101100000000… |
… | …10111010010000011 |
3 | 111102110122211001210 |
4 | 10312000113102003 |
5 | 41122431013243 |
6 | 2220032101203 |
7 | 242613021354 |
oct | 46600272203 |
9 | 14373584053 |
10 | 5201032323 |
11 | 2229935623 |
12 | 1011994803 |
13 | 64b6b7a26 |
14 | 374a71d2b |
15 | 206916933 |
hex | 136017483 |
5201032323 has 8 divisors (see below), whose sum is σ = 6937451200. Its totient is φ = 3465984168.
The previous prime is 5201032321. The next prime is 5201032349. The reversal of 5201032323 is 3232301025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5201032323 - 21 = 5201032321 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 5201032323.
It is not an unprimeable number, because it can be changed into a prime (5201032321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333793 + ... + 349026.
It is an arithmetic number, because the mean of its divisors is an integer number (867181400).
Almost surely, 25201032323 is an apocalyptic number.
5201032323 is a deficient number, since it is larger than the sum of its proper divisors (1736418877).
5201032323 is a wasteful number, since it uses less digits than its factorization.
5201032323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685361.
The product of its (nonzero) digits is 1080, while the sum is 21.
The square root of 5201032323 is about 72118.1830261967. The cubic root of 5201032323 is about 1732.5928490642.
Adding to 5201032323 its reverse (3232301025), we get a palindrome (8433333348).
The spelling of 5201032323 in words is "five billion, two hundred one million, thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •