Base | Representation |
---|---|
bin | 1001111010111010… |
… | …10110000100000111 |
3 | 111202011221101112201 |
4 | 10331131112010013 |
5 | 41401433220043 |
6 | 2240300055331 |
7 | 245661563641 |
oct | 47535260407 |
9 | 14664841481 |
10 | 5326070023 |
11 | 229347826a |
12 | 1047834547 |
13 | 66b586931 |
14 | 3874dd891 |
15 | 2128b4c4d |
hex | 13d756107 |
5326070023 has 8 divisors (see below), whose sum is σ = 5510696400. Its totient is φ = 5141508288.
The previous prime is 5326070021. The next prime is 5326070039. The reversal of 5326070023 is 3200706235.
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 5326070023 - 21 = 5326070021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5326069973 and 5326070000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5326070021) 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, 201240 + ... + 226162.
It is an arithmetic number, because the mean of its divisors is an integer number (688837050).
Almost surely, 25326070023 is an apocalyptic number.
5326070023 is a deficient number, since it is larger than the sum of its proper divisors (184626377).
5326070023 is a wasteful number, since it uses less digits than its factorization.
5326070023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32321.
The product of its (nonzero) digits is 7560, while the sum is 28.
The square root of 5326070023 is about 72979.9289051449. The cubic root of 5326070023 is about 1746.3674333984.
Adding to 5326070023 its reverse (3200706235), we get a palindrome (8526776258).
The spelling of 5326070023 in words is "five billion, three hundred twenty-six million, seventy thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •