Base | Representation |
---|---|
bin | 11000101001101000… |
… | …00101111110111011 |
3 | 1021011022022001022110 |
4 | 30110310011332323 |
5 | 204100412232303 |
6 | 10025112423403 |
7 | 645645004230 |
oct | 142464057673 |
9 | 37138261273 |
10 | 13234102203 |
11 | 568133a953 |
12 | 26940a7b63 |
13 | 132ba3920a |
14 | 8d78a7787 |
15 | 526c95703 |
hex | 314d05fbb |
13234102203 has 16 divisors (see below), whose sum is σ = 20508053760. Its totient is φ = 7434168096.
The previous prime is 13234102201. The next prime is 13234102223. The reversal of 13234102203 is 30220143231.
It is not a de Polignac number, because 13234102203 - 21 = 13234102201 is a prime.
It is a super-2 number, since 2×132341022032 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 13234102203.
It is not an unprimeable number, because it can be changed into a prime (13234102201) 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 15 ways as a sum of consecutive naturals, for example, 5339400 + ... + 5341877.
It is an arithmetic number, because the mean of its divisors is an integer number (1281753360).
Almost surely, 213234102203 is an apocalyptic number.
13234102203 is a deficient number, since it is larger than the sum of its proper divisors (7273951557).
13234102203 is a wasteful number, since it uses less digits than its factorization.
13234102203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10681346.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13234102203 its reverse (30220143231), we get a palindrome (43454245434).
The spelling of 13234102203 in words is "thirteen billion, two hundred thirty-four million, one hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •