Base | Representation |
---|---|
bin | 10101010000110111… |
… | …01001100110001110 |
3 | 1002110120202110002022 |
4 | 22220123221212032 |
5 | 141334413131100 |
6 | 5124435130142 |
7 | 552615213662 |
oct | 125033514616 |
9 | 32416673068 |
10 | 11415755150 |
11 | 4928994898 |
12 | 2267143952 |
13 | 10cc0c4207 |
14 | 7a41b68a2 |
15 | 46c315e85 |
hex | 2a86e998e |
11415755150 has 12 divisors (see below), whose sum is σ = 21233304672. Its totient is φ = 4566302040.
The previous prime is 11415755149. The next prime is 11415755213. The reversal of 11415755150 is 5155751411.
11415755150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×114157551503 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11415755150.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 114157502 + ... + 114157601.
It is an arithmetic number, because the mean of its divisors is an integer number (1769442056).
Almost surely, 211415755150 is an apocalyptic number.
11415755150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11415755150 is a deficient number, since it is larger than the sum of its proper divisors (9817549522).
11415755150 is a wasteful number, since it uses less digits than its factorization.
11415755150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228315115 (or 228315110 counting only the distinct ones).
The product of its (nonzero) digits is 17500, while the sum is 35.
The spelling of 11415755150 in words is "eleven billion, four hundred fifteen million, seven hundred fifty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •