Base | Representation |
---|---|
bin | 11000101010100110… |
… | …00100110110010111 |
3 | 1021011212120200100121 |
4 | 30111103010312113 |
5 | 204110002132043 |
6 | 10030002452411 |
7 | 646104022060 |
oct | 142523046627 |
9 | 37155520317 |
10 | 13242224023 |
11 | 56859879a6 |
12 | 2696964107 |
13 | 1330620c22 |
14 | 8d89bd567 |
15 | 52784bded |
hex | 3154c4d97 |
13242224023 has 8 divisors (see below), whose sum is σ = 15172878240. Its totient is φ = 11321296800.
The previous prime is 13242223991. The next prime is 13242224041. The reversal of 13242224023 is 32042224231.
13242224023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13242224023 - 25 = 13242223991 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13242224053) 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 7 ways as a sum of consecutive naturals, for example, 2428828 + ... + 2434273.
It is an arithmetic number, because the mean of its divisors is an integer number (1896609780).
Almost surely, 213242224023 is an apocalyptic number.
13242224023 is a deficient number, since it is larger than the sum of its proper divisors (1930654217).
13242224023 is an equidigital number, since it uses as much as digits as its factorization.
13242224023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4863497.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 13242224023 its reverse (32042224231), we get a palindrome (45284448254).
The spelling of 13242224023 in words is "thirteen billion, two hundred forty-two million, two hundred twenty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •