Base | Representation |
---|---|
bin | 110000000111001011… |
… | …0111100101110010101 |
3 | 100212200120000111201121 |
4 | 1200032112330232111 |
5 | 3143044422041041 |
6 | 115244204323541 |
7 | 10315240314250 |
oct | 1401626745625 |
9 | 325616014647 |
10 | 103320112021 |
11 | 3a8aa567435 |
12 | 180358435b1 |
13 | 9987614179 |
14 | 5001d94097 |
15 | 2a4a9617d1 |
hex | 180e5bcb95 |
103320112021 has 8 divisors (see below), whose sum is σ = 118270892480. Its totient is φ = 88417022688.
The previous prime is 103320111929. The next prime is 103320112037. The reversal of 103320112021 is 120211023301.
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 103320112021 - 29 = 103320111509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103320111986 and 103320112004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103320112121) 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, 11918136 + ... + 11926801.
It is an arithmetic number, because the mean of its divisors is an integer number (14783861560).
Almost surely, 2103320112021 is an apocalyptic number.
It is an amenable number.
103320112021 is a deficient number, since it is larger than the sum of its proper divisors (14950780459).
103320112021 is an equidigital number, since it uses as much as digits as its factorization.
103320112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23845563.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103320112021 its reverse (120211023301), we get a palindrome (223531135322).
The spelling of 103320112021 in words is "one hundred three billion, three hundred twenty million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •