Base | Representation |
---|---|
bin | 10111011011000000011111… |
… | …011000110001000010110110 |
3 | 111111201202110020211020220010 |
4 | 113123000133120301002312 |
5 | 102000213033141311202 |
6 | 1003030335454321050 |
7 | 30461205105520110 |
oct | 2733003730610266 |
9 | 444652406736803 |
10 | 103011022213302 |
11 | 2a905802602945 |
12 | b678286ab9186 |
13 | 4562b8937a148 |
14 | 1b61a8d91c3b0 |
15 | bd98469de76c |
hex | 5db01f6310b6 |
103011022213302 has 32 divisors (see below), whose sum is σ = 241196539820544. Its totient is φ = 28713873787200.
The previous prime is 103011022213291. The next prime is 103011022213339. The reversal of 103011022213302 is 203312220110301.
It is a super-2 number, since 2×1030110222133022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 29910283474 + ... + 29910286917.
It is an arithmetic number, because the mean of its divisors is an integer number (7537391869392).
Almost surely, 2103011022213302 is an apocalyptic number.
103011022213302 is an abundant number, since it is smaller than the sum of its proper divisors (138185517607242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103011022213302 is a wasteful number, since it uses less digits than its factorization.
103011022213302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59820570444.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103011022213302 its reverse (203312220110301), we get a palindrome (306323242323603).
The spelling of 103011022213302 in words is "one hundred three trillion, eleven billion, twenty-two million, two hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •