Base | Representation |
---|---|
bin | 10111011111010000100001… |
… | …001111110101010101010100 |
3 | 111112202200101102210021110112 |
4 | 113133100201033311111110 |
5 | 102020004232431432012 |
6 | 1003412443311142152 |
7 | 30521255253124112 |
oct | 2737204117652524 |
9 | 445680342707415 |
10 | 103303111202132 |
11 | 2aa08670192386 |
12 | b704a02b14958 |
13 | 458459822254a |
14 | 1b71c7c11cab2 |
15 | be223e8d0122 |
hex | 5df4213f5554 |
103303111202132 has 36 divisors (see below), whose sum is σ = 193876649436960. Its totient is φ = 48070542874464.
The previous prime is 103303111201987. The next prime is 103303111202167. The reversal of 103303111202132 is 231202111303301.
It is a super-2 number, since 2×1033031112021322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 103303111202098 and 103303111202107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 409976282 + ... + 410228177.
It is an arithmetic number, because the mean of its divisors is an integer number (5385462484360).
Almost surely, 2103303111202132 is an apocalyptic number.
It is an amenable number.
103303111202132 is a deficient number, since it is larger than the sum of its proper divisors (90573538234828).
103303111202132 is a wasteful number, since it uses less digits than its factorization.
103303111202132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820204560 (or 820204521 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 103303111202132 its reverse (231202111303301), we get a palindrome (334505222505433).
The spelling of 103303111202132 in words is "one hundred three trillion, three hundred three billion, one hundred eleven million, two hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •