Base | Representation |
---|---|
bin | 111000011111101010… |
… | …0000111101100101110 |
3 | 102121011002110210022211 |
4 | 1300333110013230232 |
5 | 3441431224321220 |
6 | 131422333001034 |
7 | 11523312142645 |
oct | 1607724075456 |
9 | 377132423284 |
10 | 121321323310 |
11 | 474a77a6960 |
12 | 1b61a32317a |
13 | b595b79b95 |
14 | 5c2ca1835c |
15 | 3250ea8b5a |
hex | 1c3f507b2e |
121321323310 has 32 divisors (see below), whose sum is σ = 252244552032. Its totient is φ = 41521735680.
The previous prime is 121321323307. The next prime is 121321323317. The reversal of 121321323310 is 13323123121.
It is a super-2 number, since 2×1213213233102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121321323317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32436987 + ... + 32440726.
It is an arithmetic number, because the mean of its divisors is an integer number (7882642251).
Almost surely, 2121321323310 is an apocalyptic number.
121321323310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121321323310 is an abundant number, since it is smaller than the sum of its proper divisors (130923228722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121321323310 is a wasteful number, since it uses less digits than its factorization.
121321323310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64877748.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 121321323310 its reverse (13323123121), we get a palindrome (134644446431).
The spelling of 121321323310 in words is "one hundred twenty-one billion, three hundred twenty-one million, three hundred twenty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •