Base | Representation |
---|---|
bin | 10111011100100111001101… |
… | …001000010000001010100110 |
3 | 111112010022010111012110211111 |
4 | 113130213031020100022212 |
5 | 102004014421143133220 |
6 | 1003153135412255234 |
7 | 30502161140354500 |
oct | 2734471510201246 |
9 | 445108114173744 |
10 | 103121311302310 |
11 | 2a948558954894 |
12 | b69572661151a |
13 | 45703b4724722 |
14 | 1b67153274d70 |
15 | bdc64e18d15a |
hex | 5dc9cd2102a6 |
103121311302310 has 96 divisors (see below), whose sum is σ = 222110631776448. Its totient is φ = 34345792938240.
The previous prime is 103121311302293. The next prime is 103121311302329. The reversal of 103121311302310 is 13203113121301.
It is a super-2 number, since 2×1031213113023102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6932992 + ... + 15947068.
It is an arithmetic number, because the mean of its divisors is an integer number (2313652414338).
Almost surely, 2103121311302310 is an apocalyptic number.
103121311302310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103121311302310 is an abundant number, since it is smaller than the sum of its proper divisors (118989320474138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103121311302310 is a wasteful number, since it uses less digits than its factorization.
103121311302310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9014766 (or 9014759 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 103121311302310 its reverse (13203113121301), we get a palindrome (116324424423611).
The spelling of 103121311302310 in words is "one hundred three trillion, one hundred twenty-one billion, three hundred eleven million, three hundred two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •