Base | Representation |
---|---|
bin | 10111011111001110101001… |
… | …100000000110100111101010 |
3 | 111112202111012102111110110010 |
4 | 113133032221200012213222 |
5 | 102014441124130420242 |
6 | 1003411512103232350 |
7 | 30521154416653644 |
oct | 2737165140064752 |
9 | 445674172443403 |
10 | 103301102201322 |
11 | 2aa0782a158333 |
12 | b7045421486b6 |
13 | 4584337c4637c |
14 | 1b71b2b39d894 |
15 | be217334089c |
hex | 5df3a98069ea |
103301102201322 has 8 divisors (see below), whose sum is σ = 206602204402656. Its totient is φ = 34433700733772.
The previous prime is 103301102201303. The next prime is 103301102201333. The reversal of 103301102201322 is 223102201103301.
It is a sphenic number, since it is the product of 3 distinct primes.
103301102201322 is an admirable number.
It is a super-3 number, since 3×1033011022013223 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8608425183438 + ... + 8608425183449.
It is an arithmetic number, because the mean of its divisors is an integer number (25825275550332).
Almost surely, 2103301102201322 is an apocalyptic number.
103301102201322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103301102201322 is a wasteful number, since it uses less digits than its factorization.
103301102201322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17216850366892.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103301102201322 its reverse (223102201103301), we get a palindrome (326403303304623).
The spelling of 103301102201322 in words is "one hundred three trillion, three hundred one billion, one hundred two million, two hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •