Base | Representation |
---|---|
bin | 100100100011001010010… |
… | …1000000101000001011001 |
3 | 122210020001010120020010122 |
4 | 1021012110220011001121 |
5 | 1124300214414201241 |
6 | 14403402113123025 |
7 | 1025631212033132 |
oct | 111062450050131 |
9 | 18706033506118 |
10 | 5023310303321 |
11 | 1667412788452 |
12 | 691674559475 |
13 | 2a590851ab5b |
14 | 1351b556ac89 |
15 | 8aa03dc804b |
hex | 49194a05059 |
5023310303321 has 4 divisors (see below), whose sum is σ = 5159075446692. Its totient is φ = 4887545159952.
The previous prime is 5023310303311. The next prime is 5023310303351. The reversal of 5023310303321 is 1233030133205.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4235627428096 + 787682875225 = 2058064^2 + 887515^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5023310303321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5023310303311) 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, 67882571630 + ... + 67882571703.
It is an arithmetic number, because the mean of its divisors is an integer number (1289768861673).
Almost surely, 25023310303321 is an apocalyptic number.
It is an amenable number.
5023310303321 is a deficient number, since it is larger than the sum of its proper divisors (135765143371).
5023310303321 is a wasteful number, since it uses less digits than its factorization.
5023310303321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135765143370.
The product of its (nonzero) digits is 4860, while the sum is 26.
Adding to 5023310303321 its reverse (1233030133205), we get a palindrome (6256340436526).
The spelling of 5023310303321 in words is "five trillion, twenty-three billion, three hundred ten million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •