Base | Representation |
---|---|
bin | 11000010000011101… |
… | …10110110110011111 |
3 | 1020121121002200011002 |
4 | 30020032312312133 |
5 | 203132342424203 |
6 | 5552132220515 |
7 | 640502536505 |
oct | 141016666637 |
9 | 36547080132 |
10 | 13023014303 |
11 | 5583174442 |
12 | 263546a73b |
13 | 12c709c130 |
14 | 8b783a675 |
15 | 51349ad88 |
hex | 3083b6d9f |
13023014303 has 8 divisors (see below), whose sum is σ = 14289403968. Its totient is φ = 11794427424.
The previous prime is 13023014297. The next prime is 13023014341. The reversal of 13023014303 is 30341032031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13023014303 - 24 = 13023014287 is a prime.
It is a super-2 number, since 2×130230143032 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13023014353) 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 7 ways as a sum of consecutive naturals, for example, 9449975 + ... + 9451352.
It is an arithmetic number, because the mean of its divisors is an integer number (1786175496).
Almost surely, 213023014303 is an apocalyptic number.
13023014303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13023014303 is a deficient number, since it is larger than the sum of its proper divisors (1266389665).
13023014303 is a wasteful number, since it uses less digits than its factorization.
13023014303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18901393.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13023014303 its reverse (30341032031), we get a palindrome (43364046334).
The spelling of 13023014303 in words is "thirteen billion, twenty-three million, fourteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •