Base | Representation |
---|---|
bin | 1110011101100… |
… | …11001001011111 |
3 | 22110021200210111 |
4 | 13032303021133 |
5 | 222024220111 |
6 | 20012150451 |
7 | 3002126500 |
oct | 716631137 |
9 | 273250714 |
10 | 121320031 |
11 | 62533598 |
12 | 34768427 |
13 | 1c199a01 |
14 | 12180ba7 |
15 | a9b6a21 |
hex | 73b325f |
121320031 has 12 divisors (see below), whose sum is σ = 141354072. Its totient is φ = 103821648.
The previous prime is 121320029. The next prime is 121320037. The reversal of 121320031 is 130023121.
It is not a de Polignac number, because 121320031 - 21 = 121320029 is a prime.
It is a super-2 number, since 2×1213200312 = 29437099843681922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121319993 and 121320020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121320037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36276 + ... + 39478.
It is an arithmetic number, because the mean of its divisors is an integer number (11779506).
Almost surely, 2121320031 is an apocalyptic number.
121320031 is a deficient number, since it is larger than the sum of its proper divisors (20034041).
121320031 is an equidigital number, since it uses as much as digits as its factorization.
121320031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3990 (or 3983 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 121320031 is about 11014.5372576427. The cubic root of 121320031 is about 495.0444214123.
Adding to 121320031 its reverse (130023121), we get a palindrome (251343152).
The spelling of 121320031 in words is "one hundred twenty-one million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •