Base | Representation |
---|---|
bin | 10111011011000000101010… |
… | …000110110000110110111010 |
3 | 111111201202220210012120022020 |
4 | 113123000222012300312322 |
5 | 102000213420210341242 |
6 | 1003030405400535310 |
7 | 30461212421166636 |
oct | 2733005206606672 |
9 | 444652823176266 |
10 | 103011202043322 |
11 | 2a9058950698a1 |
12 | b678317181536 |
13 | 4562bb76c1841 |
14 | 1b61aa976ddc6 |
15 | bd98576b26ec |
hex | 5db02a1b0dba |
103011202043322 has 16 divisors (see below), whose sum is σ = 206022527952960. Its totient is φ = 34337046703392.
The previous prime is 103011202043297. The next prime is 103011202043339. The reversal of 103011202043322 is 223340202110301.
It is a super-2 number, since 2×1030112020433222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011202043292 and 103011202043301.
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 7 ways as a sum of consecutive naturals, for example, 8385054 + ... + 16623222.
It is an arithmetic number, because the mean of its divisors is an integer number (12876407997060).
Almost surely, 2103011202043322 is an apocalyptic number.
103011202043322 is an abundant number, since it is smaller than the sum of its proper divisors (103011325909638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103011202043322 is a wasteful number, since it uses less digits than its factorization.
103011202043322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10322197.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 103011202043322 its reverse (223340202110301), we get a palindrome (326351404153623).
The spelling of 103011202043322 in words is "one hundred three trillion, eleven billion, two hundred two million, forty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •