Base | Representation |
---|---|
bin | 110101111111100010… |
… | …1001101101100111101 |
3 | 102002021122221120202112 |
4 | 1223333011031230331 |
5 | 3344430332102441 |
6 | 125133251103405 |
7 | 11243213513306 |
oct | 1537705155475 |
9 | 362248846675 |
10 | 115948706621 |
11 | 451a0027480 |
12 | 1a57aba1b65 |
13 | ac1aa76957 |
14 | 587d27d7ad |
15 | 303949c4eb |
hex | 1aff14db3d |
115948706621 has 8 divisors (see below), whose sum is σ = 126508282464. Its totient is φ = 105392261520.
The previous prime is 115948706597. The next prime is 115948706651. The reversal of 115948706621 is 126607849511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115948706621 is a prime.
It is a Duffinian number.
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 115948706621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115948706651) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 704906 + ... + 853691.
It is an arithmetic number, because the mean of its divisors is an integer number (15813535308).
Almost surely, 2115948706621 is an apocalyptic number.
115948706621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
115948706621 is a deficient number, since it is larger than the sum of its proper divisors (10559575843).
115948706621 is a wasteful number, since it uses less digits than its factorization.
115948706621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1565371.
The product of its (nonzero) digits is 725760, while the sum is 50.
The spelling of 115948706621 in words is "one hundred fifteen billion, nine hundred forty-eight million, seven hundred six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •