Base | Representation |
---|---|
bin | 11100011001000000… |
… | …11101011000101111 |
3 | 1110100020221001120112 |
4 | 32030200131120233 |
5 | 222204002033403 |
6 | 11000245410235 |
7 | 1046500512254 |
oct | 161440353057 |
9 | 43306831515 |
10 | 15242221103 |
11 | 651192234a |
12 | 2b5470997b |
13 | 158ba96b55 |
14 | a4847742b |
15 | 5e320d9d8 |
hex | 38c81d62f |
15242221103 has 8 divisors (see below), whose sum is σ = 15368632320. Its totient is φ = 15115910040.
The previous prime is 15242220997. The next prime is 15242221121. The reversal of 15242221103 is 30112224251.
15242221103 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 15242221103 - 210 = 15242220079 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 (15242221133) 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, 297728 + ... + 345146.
It is an arithmetic number, because the mean of its divisors is an integer number (1921079040).
Almost surely, 215242221103 is an apocalyptic number.
15242221103 is a deficient number, since it is larger than the sum of its proper divisors (126411217).
15242221103 is a wasteful number, since it uses less digits than its factorization.
15242221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50077.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 15242221103 its reverse (30112224251), we get a palindrome (45354445354).
The spelling of 15242221103 in words is "fifteen billion, two hundred forty-two million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •