Base | Representation |
---|---|
bin | 11000011001110101… |
… | …10011011000111011 |
3 | 1020211002001102220000 |
4 | 30030322303120323 |
5 | 203313010041243 |
6 | 10004021404043 |
7 | 642446062566 |
oct | 141472633073 |
9 | 36732042800 |
10 | 13101643323 |
11 | 56135995aa |
12 | 2657869623 |
13 | 130a46c492 |
14 | 8c40674dd |
15 | 51a32d5d3 |
hex | 30ceb363b |
13101643323 has 20 divisors (see below), whose sum is σ = 19601279808. Its totient is φ = 8721179280.
The previous prime is 13101643319. The next prime is 13101643381. The reversal of 13101643323 is 32334610131.
13101643323 is a `hidden beast` number, since 1 + 3 + 10 + 1 + 643 + 3 + 2 + 3 = 666.
It is not a de Polignac number, because 13101643323 - 22 = 13101643319 is a prime.
It is a super-2 number, since 2×131016433232 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13101643223) 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 19 ways as a sum of consecutive naturals, for example, 68811 + ... + 175892.
Almost surely, 213101643323 is an apocalyptic number.
13101643323 is a deficient number, since it is larger than the sum of its proper divisors (6499636485).
13101643323 is an equidigital number, since it uses as much as digits as its factorization.
13101643323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245376 (or 245367 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The spelling of 13101643323 in words is "thirteen billion, one hundred one million, six hundred forty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.075 sec. • engine limits •