Base | Representation |
---|---|
bin | 11010001100011001010011… |
… | …000110011011001111010001 |
3 | 120002220002221020210211111010 |
4 | 122030121103012123033101 |
5 | 110044423130243203143 |
6 | 1045002340110041133 |
7 | 33156666226611360 |
oct | 3214312306331721 |
9 | 502802836724433 |
10 | 115201007006673 |
11 | 33785522197975 |
12 | 10b068881a91a9 |
13 | 4c385401a6013 |
14 | 2063a8941b7d7 |
15 | d4b9989c0a33 |
hex | 68c65319b3d1 |
115201007006673 has 32 divisors (see below), whose sum is σ = 176962463041536. Its totient is φ = 65299335994368.
The previous prime is 115201007006647. The next prime is 115201007006737. The reversal of 115201007006673 is 376600700102511.
It is not a de Polignac number, because 115201007006673 - 28 = 115201007006417 is a prime.
It is not an unprimeable number, because it can be changed into a prime (115201007006473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39549861 + ... + 42362642.
It is an arithmetic number, because the mean of its divisors is an integer number (5530076970048).
Almost surely, 2115201007006673 is an apocalyptic number.
It is an amenable number.
115201007006673 is a deficient number, since it is larger than the sum of its proper divisors (61761456034863).
115201007006673 is a wasteful number, since it uses less digits than its factorization.
115201007006673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81913053.
The product of its (nonzero) digits is 52920, while the sum is 39.
The spelling of 115201007006673 in words is "one hundred fifteen trillion, two hundred one billion, seven million, six thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •