Base | Representation |
---|---|
bin | 1100100010010011001… |
… | …0110000011011100110 |
3 | 202120220012110120220010 |
4 | 3020210302300123212 |
5 | 12012032101301100 |
6 | 242534305151050 |
7 | 21362650551600 |
oct | 3104462603346 |
9 | 676805416803 |
10 | 215365650150 |
11 | 83377327622 |
12 | 358a562b486 |
13 | 17402840961 |
14 | a5d0ac8170 |
15 | 5907414750 |
hex | 3224cb06e6 |
215365650150 has 144 divisors (see below), whose sum is σ = 621552088656. Its totient is φ = 49207092480.
The previous prime is 215365650133. The next prime is 215365650179. The reversal of 215365650150 is 51056563512.
It is a junction number, because it is equal to n+sod(n) for n = 215365650099 and 215365650108.
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 71 ways as a sum of consecutive naturals, for example, 27904092 + ... + 27911808.
It is an arithmetic number, because the mean of its divisors is an integer number (4316333949).
Almost surely, 2215365650150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 215365650150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (310776044328).
215365650150 is an abundant number, since it is smaller than the sum of its proper divisors (406186438506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215365650150 is a wasteful number, since it uses less digits than its factorization.
215365650150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11543 (or 11531 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 215365650150 in words is "two hundred fifteen billion, three hundred sixty-five million, six hundred fifty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •