Base | Representation |
---|---|
bin | 110101111001011100… |
… | …1010001001000111101 |
3 | 102001202102020000210010 |
4 | 1223302321101020331 |
5 | 3344021011422011 |
6 | 125101104533433 |
7 | 11235151610166 |
oct | 1536271211075 |
9 | 361672200703 |
10 | 115744248381 |
11 | 450a5679a23 |
12 | 1a522621279 |
13 | abb75bb348 |
14 | 586005a76d |
15 | 30265621a6 |
hex | 1af2e5123d |
115744248381 has 4 divisors (see below), whose sum is σ = 154325664512. Its totient is φ = 77162832252.
The previous prime is 115744248353. The next prime is 115744248419. The reversal of 115744248381 is 183842447511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 115744248381 - 27 = 115744248253 is a prime.
It is a super-2 number, since 2×1157442483812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115744248381.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115744248341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19290708061 + ... + 19290708066.
It is an arithmetic number, because the mean of its divisors is an integer number (38581416128).
Almost surely, 2115744248381 is an apocalyptic number.
It is an amenable number.
115744248381 is a deficient number, since it is larger than the sum of its proper divisors (38581416131).
115744248381 is an equidigital number, since it uses as much as digits as its factorization.
115744248381 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38581416130.
The product of its digits is 860160, while the sum is 48.
The spelling of 115744248381 in words is "one hundred fifteen billion, seven hundred forty-four million, two hundred forty-eight thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •