Base | Representation |
---|---|
bin | 110101100101101101… |
… | …0011000011001111101 |
3 | 102000001020210012122202 |
4 | 1223023122120121331 |
5 | 3341141422342003 |
6 | 124511243121245 |
7 | 11212556334152 |
oct | 1531332303175 |
9 | 360036705582 |
10 | 115081840253 |
11 | 44895775996 |
12 | 1a378813225 |
13 | ab102b1683 |
14 | 57da0aa229 |
15 | 2ed8318088 |
hex | 1acb69867d |
115081840253 has 4 divisors (see below), whose sum is σ = 115116475488. Its totient is φ = 115047205020.
The previous prime is 115081840241. The next prime is 115081840267. The reversal of 115081840253 is 352048180511.
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, and also an emirpimes, since its reverse is a distinct semiprime: 352048180511 = 15299 ⋅23011189.
It is a cyclic number.
It is not a de Polignac number, because 115081840253 - 28 = 115081839997 is a prime.
It is a super-2 number, since 2×1150818402532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115081840213) 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, 17312633 + ... + 17319278.
It is an arithmetic number, because the mean of its divisors is an integer number (28779118872).
Almost surely, 2115081840253 is an apocalyptic number.
It is an amenable number.
115081840253 is a deficient number, since it is larger than the sum of its proper divisors (34635235).
115081840253 is an equidigital number, since it uses as much as digits as its factorization.
115081840253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34635234.
The product of its (nonzero) digits is 38400, while the sum is 38.
The spelling of 115081840253 in words is "one hundred fifteen billion, eighty-one million, eight hundred forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •