Base | Representation |
---|---|
bin | 11010001010100010101100… |
… | …011001100010111000000001 |
3 | 120002102221012221202010112212 |
4 | 122022202230121202320001 |
5 | 110040331321440001113 |
6 | 1044424035143431505 |
7 | 33144540321435236 |
oct | 3212425431427001 |
9 | 502387187663485 |
10 | 115073656172033 |
11 | 33736510a439a9 |
12 | 10aa6066755595 |
13 | 4c295260c9970 |
14 | 205b847b1178d |
15 | d484e35000a8 |
hex | 68a8ac662e01 |
115073656172033 has 16 divisors (see below), whose sum is σ = 127071760556160. Its totient is φ = 103557709702656.
The previous prime is 115073656172023. The next prime is 115073656172047. The reversal of 115073656172033 is 330271656370511.
It is a cyclic number.
It is not a de Polignac number, because 115073656172033 - 232 = 115069361204737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115073656172023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 680929493 + ... + 681098466.
It is an arithmetic number, because the mean of its divisors is an integer number (7941985034760).
Almost surely, 2115073656172033 is an apocalyptic number.
115073656172033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115073656172033 is a deficient number, since it is larger than the sum of its proper divisors (11998104384127).
115073656172033 is a wasteful number, since it uses less digits than its factorization.
115073656172033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362028136.
The product of its (nonzero) digits is 2381400, while the sum is 50.
The spelling of 115073656172033 in words is "one hundred fifteen trillion, seventy-three billion, six hundred fifty-six million, one hundred seventy-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •