Base | Representation |
---|---|
bin | 11000010000000111… |
… | …10010010111001101 |
3 | 1020121101122020101201 |
4 | 30020003302113031 |
5 | 203131122043313 |
6 | 5551550105501 |
7 | 640436062114 |
oct | 141003622715 |
9 | 36541566351 |
10 | 13020112333 |
11 | 5581572118 |
12 | 26344ab291 |
13 | 12c65c42a7 |
14 | 8b72c2c7b |
15 | 5130c60dd |
hex | 3080f25cd |
13020112333 has 8 divisors (see below), whose sum is σ = 13168639800. Its totient is φ = 12871634688.
The previous prime is 13020112307. The next prime is 13020112361. The reversal of 13020112333 is 33321102031.
It can be written as a sum of positive squares in 4 ways, for example, as 7941839689 + 5078272644 = 89117^2 + 71262^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13020112333 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 13020112333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13020112393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 849385 + ... + 864577.
It is an arithmetic number, because the mean of its divisors is an integer number (1646079975).
Almost surely, 213020112333 is an apocalyptic number.
It is an amenable number.
13020112333 is a deficient number, since it is larger than the sum of its proper divisors (148527467).
13020112333 is an equidigital number, since it uses as much as digits as its factorization.
13020112333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24911.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13020112333 its reverse (33321102031), we get a palindrome (46341214364).
The spelling of 13020112333 in words is "thirteen billion, twenty million, one hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •