Base | Representation |
---|---|
bin | 110000000001100110… |
… | …1001110101111101101 |
3 | 100212012111221222220002 |
4 | 1200003031032233231 |
5 | 3142204022440041 |
6 | 115213442234045 |
7 | 10310506110041 |
oct | 1400315165755 |
9 | 325174858802 |
10 | 103133015021 |
11 | 3a813997713 |
12 | 17ba3055925 |
13 | 9957926b9a |
14 | 4dc51b0021 |
15 | 2a3930559b |
hex | 180334ebed |
103133015021 has 8 divisors (see below), whose sum is σ = 103224307200. Its totient is φ = 103041758880.
The previous prime is 103133014993. The next prime is 103133015053. The reversal of 103133015021 is 120510331301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103133015021 - 226 = 103065906157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103133014984 and 103133015002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103133015621) 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 7 ways as a sum of consecutive naturals, for example, 10604441 + ... + 10614161.
It is an arithmetic number, because the mean of its divisors is an integer number (12903038400).
Almost surely, 2103133015021 is an apocalyptic number.
It is an amenable number.
103133015021 is a deficient number, since it is larger than the sum of its proper divisors (91292179).
103133015021 is an equidigital number, since it uses as much as digits as its factorization.
103133015021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18019.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 103133015021 its reverse (120510331301), we get a palindrome (223643346322).
The spelling of 103133015021 in words is "one hundred three billion, one hundred thirty-three million, fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •