Base | Representation |
---|---|
bin | 1101100001110100… |
… | …01110111110100101 |
3 | 200202011122210112100 |
4 | 12300322032332211 |
5 | 104333313214023 |
6 | 3200411442313 |
7 | 344661451131 |
oct | 66072167645 |
9 | 20664583470 |
10 | 7263023013 |
11 | 3097872764 |
12 | 14a8456399 |
13 | 8b995816c |
14 | 4cc8663c1 |
15 | 2c7971c43 |
hex | 1b0e8efa5 |
7263023013 has 12 divisors (see below), whose sum is σ = 10496360160. Its totient is φ = 4839556776.
The previous prime is 7263022993. The next prime is 7263023021. The reversal of 7263023013 is 3103203627.
7263023013 is a `hidden beast` number, since 7 + 2 + 630 + 23 + 0 + 1 + 3 = 666.
7263023013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 7263023013 - 28 = 7263022757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7263023213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 186081 + ... + 221702.
It is an arithmetic number, because the mean of its divisors is an integer number (874696680).
Almost surely, 27263023013 is an apocalyptic number.
It is an amenable number.
7263023013 is a deficient number, since it is larger than the sum of its proper divisors (3233337147).
7263023013 is a wasteful number, since it uses less digits than its factorization.
7263023013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409768 (or 409765 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 27.
The square root of 7263023013 is about 85223.3712839383. The cubic root of 7263023013 is about 1936.5964886624.
The spelling of 7263023013 in words is "seven billion, two hundred sixty-three million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •