Base | Representation |
---|---|
bin | 110101101011011101… |
… | …0100101011000110101 |
3 | 102000112200221011202111 |
4 | 1223112322211120311 |
5 | 3342040324101123 |
6 | 124542335411021 |
7 | 11220421620460 |
oct | 1532672453065 |
9 | 360480834674 |
10 | 115274831413 |
11 | 44984701015 |
12 | 1a411383a71 |
13 | ab41283721 |
14 | 58179862d7 |
15 | 2eea23a90d |
hex | 1ad6ea5635 |
115274831413 has 8 divisors (see below), whose sum is σ = 131778561728. Its totient is φ = 98780075424.
The previous prime is 115274831387. The next prime is 115274831417. The reversal of 115274831413 is 314138472511.
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-115274831413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115274831417) 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, 2216031 + ... + 2267452.
It is an arithmetic number, because the mean of its divisors is an integer number (16472320216).
Almost surely, 2115274831413 is an apocalyptic number.
It is an amenable number.
115274831413 is a deficient number, since it is larger than the sum of its proper divisors (16503730315).
115274831413 is an equidigital number, since it uses as much as digits as its factorization.
115274831413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4487163.
The product of its digits is 80640, while the sum is 40.
The spelling of 115274831413 in words is "one hundred fifteen billion, two hundred seventy-four million, eight hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •