Base | Representation |
---|---|
bin | 10111011111010000101100… |
… | …100100101111101010011110 |
3 | 111112202200212200100212020022 |
4 | 113133100230210233222132 |
5 | 102020010130103431220 |
6 | 1003412514220152142 |
7 | 30521263051301633 |
oct | 2737205444575236 |
9 | 445680780325208 |
10 | 103303301233310 |
11 | 2aa08758486642 |
12 | b704a56698652 |
13 | 45845c86c9229 |
14 | 1b71c9946818a |
15 | be225141a925 |
hex | 5df42c92fa9e |
103303301233310 has 32 divisors (see below), whose sum is σ = 196888832142912. Its totient is φ = 38889688000000.
The previous prime is 103303301233267. The next prime is 103303301233331. The reversal of 103303301233310 is 13332103303301.
It is a happy number.
It is a super-2 number, since 2×1033033012333102 (a number of 29 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 103303301233310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 672941 + ... + 14389560.
It is an arithmetic number, because the mean of its divisors is an integer number (6152776004466).
Almost surely, 2103303301233310 is an apocalyptic number.
103303301233310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103303301233310 is a deficient number, since it is larger than the sum of its proper divisors (93585530909602).
103303301233310 is a wasteful number, since it uses less digits than its factorization.
103303301233310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15102868.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 103303301233310 its reverse (13332103303301), we get a palindrome (116635404536611).
The spelling of 103303301233310 in words is "one hundred three trillion, three hundred three billion, three hundred one million, two hundred thirty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •