Base | Representation |
---|---|
bin | 1001010100011011… |
… | …10010000100011011 |
3 | 110220200110002010112 |
4 | 10222031302010123 |
5 | 40221311121243 |
6 | 2144244234535 |
7 | 234661460630 |
oct | 45215620433 |
9 | 13820402115 |
10 | 5003223323 |
11 | 213820980a |
12 | b7769ba4b |
13 | 619719a97 |
14 | 3566a0187 |
15 | 1e4391818 |
hex | 12a37211b |
5003223323 has 4 divisors (see below), whose sum is σ = 5717969520. Its totient is φ = 4288477128.
The previous prime is 5003223311. The next prime is 5003223389. The reversal of 5003223323 is 3233223005.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3233223005 = 5 ⋅646644601.
It is a cyclic number.
It is not a de Polignac number, because 5003223323 - 212 = 5003219227 is a prime.
It is a super-2 number, since 2×50032233232 = 50064487239622324658, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5003226323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 357373088 + ... + 357373101.
It is an arithmetic number, because the mean of its divisors is an integer number (1429492380).
Almost surely, 25003223323 is an apocalyptic number.
5003223323 is a deficient number, since it is larger than the sum of its proper divisors (714746197).
5003223323 is an equidigital number, since it uses as much as digits as its factorization.
5003223323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714746196.
The product of its (nonzero) digits is 3240, while the sum is 23.
The square root of 5003223323 is about 70733.4667819979. The cubic root of 5003223323 is about 1710.3433213967.
Adding to 5003223323 its reverse (3233223005), we get a palindrome (8236446328).
The spelling of 5003223323 in words is "five billion, three million, two hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •