Base | Representation |
---|---|
bin | 101100000000011001110000… |
… | …001101101000111011101000 |
3 | 221101021101221202202012122122 |
4 | 230000121300031220323220 |
5 | 200331441344410303242 |
6 | 1523343455023410412 |
7 | 55523632503003563 |
oct | 5400316015507350 |
9 | 841241852665578 |
10 | 193541698916072 |
11 | 56739634464311 |
12 | 19859817453a08 |
13 | 83cbb99b20970 |
14 | 35b167aaa14da |
15 | 17596e51e7ad2 |
hex | b00670368ee8 |
193541698916072 has 64 divisors (see below), whose sum is σ = 403929040999680. Its totient is φ = 86373034935552.
The previous prime is 193541698916039. The next prime is 193541698916077. The reversal of 193541698916072 is 270619896145391.
It is a junction number, because it is equal to n+sod(n) for n = 193541698915987 and 193541698916005.
It is not an unprimeable number, because it can be changed into a prime (193541698916077) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 238120043 + ... + 238931450.
It is an arithmetic number, because the mean of its divisors is an integer number (6311391265620).
It is a 1-persistent number, because it is pandigital, but 2⋅193541698916072 = 387083397832144 is not.
Almost surely, 2193541698916072 is an apocalyptic number.
It is an amenable number.
193541698916072 is an abundant number, since it is smaller than the sum of its proper divisors (210387342083608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
193541698916072 is a wasteful number, since it uses less digits than its factorization.
193541698916072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 477051642 (or 477051638 counting only the distinct ones).
The product of its (nonzero) digits is 176359680, while the sum is 71.
The spelling of 193541698916072 in words is "one hundred ninety-three trillion, five hundred forty-one billion, six hundred ninety-eight million, nine hundred sixteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •