Base | Representation |
---|---|
bin | 11010001001100010110011… |
… | …001010010100100110110001 |
3 | 120002012101010200101212101010 |
4 | 122021202303022110212301 |
5 | 110033220320314121301 |
6 | 1044332331330301133 |
7 | 33136561232020266 |
oct | 3211426312244661 |
9 | 502171120355333 |
10 | 115005050145201 |
11 | 3370a4056a4577 |
12 | 10a948ba7277a9 |
13 | 4c22c11700808 |
14 | 20583ba2bd26d |
15 | d4682a4935d6 |
hex | 6898b32949b1 |
115005050145201 has 8 divisors (see below), whose sum is σ = 153340342286560. Its totient is φ = 76669895716992.
The previous prime is 115005050145157. The next prime is 115005050145211. The reversal of 115005050145201 is 102541050500511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115005050145201 - 26 = 115005050145137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115005050145211) 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, 32463691 + ... + 35831568.
It is an arithmetic number, because the mean of its divisors is an integer number (19167542785820).
Almost surely, 2115005050145201 is an apocalyptic number.
It is an amenable number.
115005050145201 is a deficient number, since it is larger than the sum of its proper divisors (38335292141359).
115005050145201 is an equidigital number, since it uses as much as digits as its factorization.
115005050145201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68856575.
The product of its (nonzero) digits is 5000, while the sum is 30.
The spelling of 115005050145201 in words is "one hundred fifteen trillion, five billion, fifty million, one hundred forty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •