Base | Representation |
---|---|
bin | 110110000000000000… |
… | …0010110111111001110 |
3 | 102002022202010021222100 |
4 | 1230000000112333032 |
5 | 3344443314224100 |
6 | 125135003255530 |
7 | 11243462350104 |
oct | 1540000267716 |
9 | 362282107870 |
10 | 115964211150 |
11 | 451a8857237 |
12 | 1a58421a5a6 |
13 | ac21044b28 |
14 | 5881357c74 |
15 | 303aa11400 |
hex | 1b00016fce |
115964211150 has 36 divisors (see below), whose sum is σ = 311557181832. Its totient is φ = 30923789520.
The previous prime is 115964211149. The next prime is 115964211151. The reversal of 115964211150 is 51112469511.
It is a happy number.
115964211150 is a `hidden beast` number, since 1 + 1 + 5 + 9 + 642 + 1 + 1 + 1 + 5 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (115964211149) and next prime (115964211151).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115964211151) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 128848674 + ... + 128849573.
It is an arithmetic number, because the mean of its divisors is an integer number (8654366162).
Almost surely, 2115964211150 is an apocalyptic number.
115964211150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115964211150 is an abundant number, since it is smaller than the sum of its proper divisors (195592970682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115964211150 is a wasteful number, since it uses less digits than its factorization.
115964211150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257698265 (or 257698257 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 36.
The spelling of 115964211150 in words is "one hundred fifteen billion, nine hundred sixty-four million, two hundred eleven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •