Base | Representation |
---|---|
bin | 110001101000… |
… | …010001100111 |
3 | 220110222101201 |
4 | 301220101213 |
5 | 11312310043 |
6 | 1142503331 |
7 | 215404045 |
oct | 61502147 |
9 | 26428351 |
10 | 13010023 |
11 | 7386694 |
12 | 4434b47 |
13 | 2906950 |
14 | 1a29395 |
15 | 121ec4d |
hex | c68467 |
13010023 has 16 divisors (see below), whose sum is σ = 14515200. Its totient is φ = 11585376.
The previous prime is 13009967. The next prime is 13010047. The reversal of 13010023 is 32001031.
It is a cyclic number.
It is not a de Polignac number, because 13010023 - 29 = 13009511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13009991 and 13010009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13010623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65278 + ... + 65476.
It is an arithmetic number, because the mean of its divisors is an integer number (907200).
Almost surely, 213010023 is an apocalyptic number.
13010023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13010023 is a deficient number, since it is larger than the sum of its proper divisors (1505177).
13010023 is a wasteful number, since it uses less digits than its factorization.
13010023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366.
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 13010023 is about 3606.9409476730. The cubic root of 13010023 is about 235.1938825499.
Adding to 13010023 its reverse (32001031), we get a palindrome (45011054).
It can be divided in two parts, 130 and 10023, that added together give a triangular number (10153 = T142).
The spelling of 13010023 in words is "thirteen million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •