Base | Representation |
---|---|
bin | 1101101100010101001100… |
… | …1010100110111001000110 |
3 | 1222022021020122121211222010 |
4 | 3123011103022212321012 |
5 | 3433131130422142100 |
6 | 52004142230115050 |
7 | 3112464161443404 |
oct | 333052312467106 |
9 | 58267218554863 |
10 | 15055255662150 |
11 | 4884997371370 |
12 | 18319867aba86 |
13 | 852920a93a62 |
14 | 3a096d218474 |
15 | 1b194d612750 |
hex | db1532a6e46 |
15055255662150 has 96 divisors (see below), whose sum is σ = 40734321550848. Its totient is φ = 3649489084800.
The previous prime is 15055255662019. The next prime is 15055255662193. The reversal of 15055255662150 is 5126655255051.
15055255662150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 15055255662150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22451124 + ... + 23111976.
It is an arithmetic number, because the mean of its divisors is an integer number (424315849488).
Almost surely, 215055255662150 is an apocalyptic number.
15055255662150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15055255662150 is an abundant number, since it is smaller than the sum of its proper divisors (25679065888698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15055255662150 is a wasteful number, since it uses less digits than its factorization.
15055255662150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674686 (or 674681 counting only the distinct ones).
The product of its (nonzero) digits is 2250000, while the sum is 48.
The spelling of 15055255662150 in words is "fifteen trillion, fifty-five billion, two hundred fifty-five million, six hundred sixty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •