Base | Representation |
---|---|
bin | 1110010100100… |
… | …01111010100011 |
3 | 22101001111200201 |
4 | 13022101322203 |
5 | 221223312311 |
6 | 15530530031 |
7 | 2656063531 |
oct | 712217243 |
9 | 271044621 |
10 | 120135331 |
11 | 618a44a8 |
12 | 34296917 |
13 | 1bb736c4 |
14 | 11d53151 |
15 | a8309c1 |
hex | 7291ea3 |
120135331 has 4 divisors (see below), whose sum is σ = 121237600. Its totient is φ = 119033064.
The previous prime is 120135329. The next prime is 120135341. The reversal of 120135331 is 133531021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133531021 = 13 ⋅10271617.
It is a cyclic number.
It is not a de Polignac number, because 120135331 - 21 = 120135329 is a prime.
It is a super-2 number, since 2×1201353312 = 28864995508959122, 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 = 120135299 and 120135308.
It is not an unprimeable number, because it can be changed into a prime (120135341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550971 + ... + 551188.
It is an arithmetic number, because the mean of its divisors is an integer number (30309400).
Almost surely, 2120135331 is an apocalyptic number.
120135331 is a deficient number, since it is larger than the sum of its proper divisors (1102269).
120135331 is a wasteful number, since it uses less digits than its factorization.
120135331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1102268.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 120135331 is about 10960.6263963334. The cubic root of 120135331 is about 493.4277646215.
Adding to 120135331 its reverse (133531021), we get a palindrome (253666352).
The spelling of 120135331 in words is "one hundred twenty million, one hundred thirty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •