Base | Representation |
---|---|
bin | 11010001001011111001111… |
… | …001010101000101111000010 |
3 | 120002012000021002202111100100 |
4 | 122021133033022220233002 |
5 | 110033140002101204102 |
6 | 1044330500004503230 |
7 | 33136364364014625 |
oct | 3211371712505702 |
9 | 502160232674310 |
10 | 115001225022402 |
11 | 337088224a4164 |
12 | 10a940116aab16 |
13 | 4c227520ab344 |
14 | 205813628bdbc |
15 | d466a4763a1c |
hex | 6897cf2a8bc2 |
115001225022402 has 12 divisors (see below), whose sum is σ = 249169320881910. Its totient is φ = 38333741674128.
The previous prime is 115001225022367. The next prime is 115001225022407. The reversal of 115001225022402 is 204220522100511.
115001225022402 is a `hidden beast` number, since 1 + 1 + 5 + 0 + 0 + 1 + 2 + 250 + 2 + 2 + 402 = 666.
It can be written as a sum of positive squares in only one way, i.e., 114874902356841 + 126322665561 = 10717971^2 + 355419^2 .
It is not an unprimeable number, because it can be changed into a prime (115001225022407) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3194478472827 + ... + 3194478472862.
Almost surely, 2115001225022402 is an apocalyptic number.
115001225022402 is an abundant number, since it is smaller than the sum of its proper divisors (134168095859508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115001225022402 is a wasteful number, since it uses less digits than its factorization.
115001225022402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6388956945697 (or 6388956945694 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 115001225022402 its reverse (204220522100511), we get a palindrome (319221747122913).
The spelling of 115001225022402 in words is "one hundred fifteen trillion, one billion, two hundred twenty-five million, twenty-two thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •