Base | Representation |
---|---|
bin | 110000000101001011… |
… | …1000101101110010101 |
3 | 100212111212210220020110 |
4 | 1200022113011232111 |
5 | 3142430234240041 |
6 | 115233410553233 |
7 | 10313464234125 |
oct | 1401227055625 |
9 | 325455726213 |
10 | 103253040021 |
11 | 3a87571622a |
12 | 18017298819 |
13 | 997675c2b1 |
14 | 4dd70d4c85 |
15 | 2a44b13516 |
hex | 180a5c5b95 |
103253040021 has 32 divisors (see below), whose sum is σ = 139869004032. Its totient is φ = 67746631680.
The previous prime is 103253040019. The next prime is 103253040031. The reversal of 103253040021 is 120040352301.
It is not a de Polignac number, because 103253040021 - 21 = 103253040019 is a prime.
It is a super-2 number, since 2×1032530400212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103253040021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103253040031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29814336 + ... + 29817798.
It is an arithmetic number, because the mean of its divisors is an integer number (4370906376).
Almost surely, 2103253040021 is an apocalyptic number.
It is an amenable number.
103253040021 is a deficient number, since it is larger than the sum of its proper divisors (36615964011).
103253040021 is a wasteful number, since it uses less digits than its factorization.
103253040021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4173.
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 103253040021 its reverse (120040352301), we get a palindrome (223293392322).
The spelling of 103253040021 in words is "one hundred three billion, two hundred fifty-three million, forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •