Base | Representation |
---|---|
bin | 110010010111… |
… | …011111101001 |
3 | 220211210201001 |
4 | 302113133221 |
5 | 11340002213 |
6 | 1150555001 |
7 | 220140655 |
oct | 62273751 |
9 | 26753631 |
10 | 13203433 |
11 | 74a8a31 |
12 | 4508a61 |
13 | 29739a9 |
14 | 1a79a65 |
15 | 125c1dd |
hex | c977e9 |
13203433 has 6 divisors (see below), whose sum is σ = 13434554. Its totient is φ = 12976224.
The previous prime is 13203431. The next prime is 13203457. The reversal of 13203433 is 33430231.
13203433 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 9412624 + 3790809 = 3068^2 + 1947^2 .
It is not a de Polignac number, because 13203433 - 21 = 13203431 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13203433.
It is not an unprimeable number, because it can be changed into a prime (13203431) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1585 + ... + 5377.
Almost surely, 213203433 is an apocalyptic number.
It is an amenable number.
13203433 is a deficient number, since it is larger than the sum of its proper divisors (231121).
13203433 is an frugal number, since it uses more digits than its factorization.
13203433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3911 (or 3852 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 19.
The square root of 13203433 is about 3633.6528452784. The cubic root of 13203433 is about 236.3536364919.
Adding to 13203433 its reverse (33430231), we get a palindrome (46633664).
It can be divided in two parts, 1320 and 3433, that added together give a triangular number (4753 = T97).
The spelling of 13203433 in words is "thirteen million, two hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •