Base | Representation |
---|---|
bin | 10111100100100001000010… |
… | …011001100001001101001001 |
3 | 111121001020001101101212202010 |
4 | 113210201002121201031021 |
5 | 102041414240312021441 |
6 | 1004250442144530133 |
7 | 30556336401521346 |
oct | 2744410231411511 |
9 | 447036041355663 |
10 | 103664444642121 |
11 | 30037931523960 |
12 | b762a44920949 |
13 | 45ac690b23c7c |
14 | 1b85558c5b7cd |
15 | beb83b8da116 |
hex | 5e4842661349 |
103664444642121 has 64 divisors (see below), whose sum is σ = 153510108364800. Its totient is φ = 61701611328000.
The previous prime is 103664444642119. The next prime is 103664444642131. The reversal of 103664444642121 is 121246444466301.
It is a happy number.
It is not a de Polignac number, because 103664444642121 - 21 = 103664444642119 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103664444642131) 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 63 ways as a sum of consecutive naturals, for example, 2141404965 + ... + 2141453373.
It is an arithmetic number, because the mean of its divisors is an integer number (2398595443200).
Almost surely, 2103664444642121 is an apocalyptic number.
103664444642121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103664444642121 is a deficient number, since it is larger than the sum of its proper divisors (49845663722679).
103664444642121 is a wasteful number, since it uses less digits than its factorization.
103664444642121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53710.
The product of its (nonzero) digits is 2654208, while the sum is 48.
The spelling of 103664444642121 in words is "one hundred three trillion, six hundred sixty-four billion, four hundred forty-four million, six hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •