Base | Representation |
---|---|
bin | 111000011100101001… |
… | …0110101000000100001 |
3 | 102120220001102100122010 |
4 | 1300321102311000201 |
5 | 3441224400240223 |
6 | 131404324103133 |
7 | 11520644505330 |
oct | 1607122650041 |
9 | 376801370563 |
10 | 121220321313 |
11 | 47455790633 |
12 | 1b5b0534aa9 |
13 | b57ac752a0 |
14 | 5c1d445d17 |
15 | 32471a7393 |
hex | 1c394b5021 |
121220321313 has 64 divisors (see below), whose sum is σ = 203034460160. Its totient is φ = 62632507392.
The previous prime is 121220321279. The next prime is 121220321353. The reversal of 121220321313 is 313123022121.
It is not a de Polignac number, because 121220321313 - 212 = 121220317217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 121220321313.
It is not an unprimeable number, because it can be changed into a prime (121220321353) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2716881 + ... + 2761137.
It is an arithmetic number, because the mean of its divisors is an integer number (3172413440).
Almost surely, 2121220321313 is an apocalyptic number.
121220321313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
121220321313 is a deficient number, since it is larger than the sum of its proper divisors (81814138847).
121220321313 is a wasteful number, since it uses less digits than its factorization.
121220321313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44486.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121220321313 its reverse (313123022121), we get a palindrome (434343343434).
The spelling of 121220321313 in words is "one hundred twenty-one billion, two hundred twenty million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •