Base | Representation |
---|---|
bin | 101111111111010100… |
… | …1110110110100110101 |
3 | 100212000012020101122120 |
4 | 1133332221312310311 |
5 | 3142024444230031 |
6 | 115202113150153 |
7 | 10305560633250 |
oct | 1377651666465 |
9 | 325005211576 |
10 | 103056633141 |
11 | 3a7848678a0 |
12 | 17b8155b359 |
13 | 9944b625c7 |
14 | 4db8daa097 |
15 | 2a32768a96 |
hex | 17fea76d35 |
103056633141 has 32 divisors (see below), whose sum is σ = 175299007488. Its totient is φ = 52290887040.
The previous prime is 103056633107. The next prime is 103056633143. The reversal of 103056633141 is 141336650301.
It is not a de Polignac number, because 103056633141 - 29 = 103056632629 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103056633143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5177656 + ... + 5197521.
It is an arithmetic number, because the mean of its divisors is an integer number (5478093984).
Almost surely, 2103056633141 is an apocalyptic number.
103056633141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103056633141 is a deficient number, since it is larger than the sum of its proper divisors (72242374347).
103056633141 is a wasteful number, since it uses less digits than its factorization.
103056633141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10375241.
The product of its (nonzero) digits is 19440, while the sum is 33.
The spelling of 103056633141 in words is "one hundred three billion, fifty-six million, six hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •