Base | Representation |
---|---|
bin | 11000011100110011100101… |
… | …101001010101110000101001 |
3 | 112002202000120112211102200010 |
4 | 120130303211221111300221 |
5 | 103043303333413322103 |
6 | 1020411452545002133 |
7 | 31435656261103164 |
oct | 3034634551256051 |
9 | 462660515742603 |
10 | 107532654042153 |
11 | 3129938492210a |
12 | 10088670323349 |
13 | 4800393a99572 |
14 | 1c7a872d84adb |
15 | c67287733903 |
hex | 61cce5a55c29 |
107532654042153 has 8 divisors (see below), whose sum is σ = 143604093726016. Its totient is φ = 71574825193200.
The previous prime is 107532654042139. The next prime is 107532654042157. The reversal of 107532654042153 is 351240456235701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107532654042153 - 234 = 107515474172969 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (107532654042157) 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 7 ways as a sum of consecutive naturals, for example, 28402706518 + ... + 28402710303.
It is an arithmetic number, because the mean of its divisors is an integer number (17950511715752).
Almost surely, 2107532654042153 is an apocalyptic number.
It is an amenable number.
107532654042153 is a deficient number, since it is larger than the sum of its proper divisors (36071439683863).
107532654042153 is an equidigital number, since it uses as much as digits as its factorization.
107532654042153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56805417455.
The product of its (nonzero) digits is 3024000, while the sum is 48.
The spelling of 107532654042153 in words is "one hundred seven trillion, five hundred thirty-two billion, six hundred fifty-four million, forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •