Base | Representation |
---|---|
bin | 11000010001101101… |
… | …00110011111000110 |
3 | 1020122022200222221212 |
4 | 30020312212133012 |
5 | 203143024324110 |
6 | 5553143411422 |
7 | 640660232012 |
oct | 141066463706 |
9 | 36568628855 |
10 | 13033433030 |
11 | 5589040162 |
12 | 2638a53b72 |
13 | 12c92a9467 |
14 | 8b8d8d542 |
15 | 514357e05 |
hex | 308da67c6 |
13033433030 has 16 divisors (see below), whose sum is σ = 23468050944. Its totient is φ = 5211624000.
The previous prime is 13033433011. The next prime is 13033433041. The reversal of 13033433030 is 3033433031.
13033433030 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13033432987 and 13033433005.
It is a congruent number.
It is an unprimeable number.
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, 187142 + ... + 247161.
It is an arithmetic number, because the mean of its divisors is an integer number (1466753184).
Almost surely, 213033433030 is an apocalyptic number.
13033433030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13033433030 is a deficient number, since it is larger than the sum of its proper divisors (10434617914).
13033433030 is a wasteful number, since it uses less digits than its factorization.
13033433030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437311.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 13033433030 its reverse (3033433031), we get a palindrome (16066866061).
Subtracting from 13033433030 its reverse (3033433031), we obtain a palindrome (9999999999).
The spelling of 13033433030 in words is "thirteen billion, thirty-three million, four hundred thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •