Base | Representation |
---|---|
bin | 10111011100100111001101… |
… | …101101010010111111011010 |
3 | 111112010022011011110211200110 |
4 | 113130213031231102333122 |
5 | 102004014431134410320 |
6 | 1003153140400345150 |
7 | 30502161316041243 |
oct | 2734471555227732 |
9 | 445108134424613 |
10 | 103121321013210 |
11 | 2a948563387825 |
12 | b6957299151b6 |
13 | 45703b6744816 |
14 | 1b67154681cca |
15 | bdc64ee5a5e0 |
hex | 5dc9cdb52fda |
103121321013210 has 64 divisors (see below), whose sum is σ = 248762006824320. Its totient is φ = 27358038865920.
The previous prime is 103121321013167. The next prime is 103121321013211. The reversal of 103121321013210 is 12310123121301.
It is not an unprimeable number, because it can be changed into a prime (103121321013211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 368854 + ... + 14365886.
It is an arithmetic number, because the mean of its divisors is an integer number (3886906356630).
Almost surely, 2103121321013210 is an apocalyptic number.
103121321013210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103121321013210 is an abundant number, since it is smaller than the sum of its proper divisors (145640685811110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103121321013210 is a wasteful number, since it uses less digits than its factorization.
103121321013210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13998303.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 103121321013210 its reverse (12310123121301), we get a palindrome (115431444134511).
The spelling of 103121321013210 in words is "one hundred three trillion, one hundred twenty-one billion, three hundred twenty-one million, thirteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •