Base | Representation |
---|---|
bin | 110101101000011000… |
… | …0011011111100010110 |
3 | 102000021111111210200001 |
4 | 1223100300123330112 |
5 | 3341332401223430 |
6 | 124524205041514 |
7 | 11215025444140 |
oct | 1532060337426 |
9 | 360244453601 |
10 | 115171507990 |
11 | 4493134a660 |
12 | 1a3a285629a |
13 | ab25a482c6 |
14 | 5807d6bc90 |
15 | 2ee112b3ca |
hex | 1ad0c1bf16 |
115171507990 has 128 divisors (see below), whose sum is σ = 270601067520. Its totient is φ = 34241625600.
The previous prime is 115171507981. The next prime is 115171507991. The reversal of 115171507990 is 99705171511.
It is a self number, because there is not a number n which added to its sum of digits gives 115171507990.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115171507991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1822320 + ... + 1884460.
It is an arithmetic number, because the mean of its divisors is an integer number (2114070840).
Almost surely, 2115171507990 is an apocalyptic number.
115171507990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115171507990 is an abundant number, since it is smaller than the sum of its proper divisors (155429559530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115171507990 is a wasteful number, since it uses less digits than its factorization.
115171507990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62278.
The product of its (nonzero) digits is 99225, while the sum is 46.
The spelling of 115171507990 in words is "one hundred fifteen billion, one hundred seventy-one million, five hundred seven thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •