Base | Representation |
---|---|
bin | 1110010110100… |
… | …11010011001111 |
3 | 22101120010001222 |
4 | 13023103103033 |
5 | 221310400101 |
6 | 15540353555 |
7 | 2661260411 |
oct | 713232317 |
9 | 271503058 |
10 | 120403151 |
11 | 61a67740 |
12 | 343a58bb |
13 | 1bc3858b |
14 | 11dc29b1 |
15 | a88501b |
hex | 72d34cf |
120403151 has 4 divisors (see below), whose sum is σ = 131348904. Its totient is φ = 109457400.
The previous prime is 120403147. The next prime is 120403187. The reversal of 120403151 is 151304021.
120403151 is nontrivially palindromic in base 8.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151304021 = 11 ⋅13754911.
It is a cyclic number.
It is not a de Polignac number, because 120403151 - 22 = 120403147 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120403951) 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, 5472860 + ... + 5472881.
It is an arithmetic number, because the mean of its divisors is an integer number (32837226).
Almost surely, 2120403151 is an apocalyptic number.
120403151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120403151 is a deficient number, since it is larger than the sum of its proper divisors (10945753).
120403151 is a wasteful number, since it uses less digits than its factorization.
120403151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10945752.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 120403151 is about 10972.8369622445. The cubic root of 120403151 is about 493.7941618140.
Adding to 120403151 its reverse (151304021), we get a palindrome (271707172).
The spelling of 120403151 in words is "one hundred twenty million, four hundred three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •