Base | Representation |
---|---|
bin | 11100010101100100… |
… | …10011001001110110 |
3 | 1110021020120220202010 |
4 | 32022302103021312 |
5 | 222124103441400 |
6 | 10553334425050 |
7 | 1046000166462 |
oct | 161262231166 |
9 | 43236526663 |
10 | 15213343350 |
11 | 64a7599037 |
12 | 2b46b02186 |
13 | 1585ac591a |
14 | a446bb4a2 |
15 | 5e0907450 |
hex | 38ac93276 |
15213343350 has 48 divisors (see below), whose sum is σ = 39948456528. Its totient is φ = 3818250240.
The previous prime is 15213343303. The next prime is 15213343357. The reversal of 15213343350 is 5334331251.
15213343350 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15213343357) 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 23 ways as a sum of consecutive naturals, for example, 2980459 + ... + 2985558.
It is an arithmetic number, because the mean of its divisors is an integer number (832259511).
Almost surely, 215213343350 is an apocalyptic number.
15213343350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15213343350 is an abundant number, since it is smaller than the sum of its proper divisors (24735113178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15213343350 is a wasteful number, since it uses less digits than its factorization.
15213343350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5966049 (or 5966044 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
The spelling of 15213343350 in words is "fifteen billion, two hundred thirteen million, three hundred forty-three thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •