Base | Representation |
---|---|
bin | 101111111110100110… |
… | …1000010010111011101 |
3 | 100211221111110012020221 |
4 | 1133331031002113131 |
5 | 3142002232113041 |
6 | 115155443441341 |
7 | 10305144052156 |
oct | 1377515022735 |
9 | 324844405227 |
10 | 103032301021 |
11 | 3a772058801 |
12 | 17b75386251 |
13 | 993cac33c0 |
14 | 4db5a7492d |
15 | 2a3055e2d1 |
hex | 17fd3425dd |
103032301021 has 8 divisors (see below), whose sum is σ = 111538796544. Its totient is φ = 94608796080.
The previous prime is 103032301019. The next prime is 103032301037. The reversal of 103032301021 is 120103230301.
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 103032301021 - 21 = 103032301019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103032300986 and 103032301004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103032301321) 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, 20745061 + ... + 20750026.
It is an arithmetic number, because the mean of its divisors is an integer number (13942349568).
Almost surely, 2103032301021 is an apocalyptic number.
It is an amenable number.
103032301021 is a deficient number, since it is larger than the sum of its proper divisors (8506495523).
103032301021 is a wasteful number, since it uses less digits than its factorization.
103032301021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41495291.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 103032301021 its reverse (120103230301), we get a palindrome (223135531322).
The spelling of 103032301021 in words is "one hundred three billion, thirty-two million, three hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •