Base | Representation |
---|---|
bin | 11000010001101011… |
… | …10000100100111111 |
3 | 1020122022021210001211 |
4 | 30020311300210333 |
5 | 203143000242343 |
6 | 5553134545251 |
7 | 640655322163 |
oct | 141065604477 |
9 | 36568253054 |
10 | 13033212223 |
11 | 55889aa279 |
12 | 2638968227 |
13 | 12c922cac5 |
14 | 8b8d32ca3 |
15 | 51431279d |
hex | 308d7093f |
13033212223 has 16 divisors (see below), whose sum is σ = 14103138816. Its totient is φ = 12011772960.
The previous prime is 13033212217. The next prime is 13033212239. The reversal of 13033212223 is 32221233031.
13033212223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13033212223 - 225 = 12999657791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13033212194 and 13033212203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13033212253) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 13308 + ... + 161998.
It is an arithmetic number, because the mean of its divisors is an integer number (881446176).
Almost surely, 213033212223 is an apocalyptic number.
13033212223 is a deficient number, since it is larger than the sum of its proper divisors (1069926593).
13033212223 is a wasteful number, since it uses less digits than its factorization.
13033212223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148854.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 13033212223 its reverse (32221233031), we get a palindrome (45254445254).
The spelling of 13033212223 in words is "thirteen billion, thirty-three million, two hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •