Base | Representation |
---|---|
bin | 10010000110001… |
… | …11110000011111 |
3 | 101120122220111022 |
4 | 21003013300133 |
5 | 302331010101 |
6 | 23021514355 |
7 | 3522250640 |
oct | 1103076037 |
9 | 346586438 |
10 | 151813151 |
11 | 78770516 |
12 | 42a129bb |
13 | 255b5289 |
14 | 1623b6c7 |
15 | d4dba1b |
hex | 90c7c1f |
151813151 has 4 divisors (see below), whose sum is σ = 173500752. Its totient is φ = 130125552.
The previous prime is 151813141. The next prime is 151813153. The reversal of 151813151 is 151318151.
151813151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151318151 = 307 ⋅492893.
It is a cyclic number.
It is not a de Polignac number, because 151813151 - 210 = 151812127 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 151813151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151813153) 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, 10843790 + ... + 10843803.
It is an arithmetic number, because the mean of its divisors is an integer number (43375188).
Almost surely, 2151813151 is an apocalyptic number.
151813151 is a deficient number, since it is larger than the sum of its proper divisors (21687601).
151813151 is an equidigital number, since it uses as much as digits as its factorization.
151813151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21687600.
The product of its digits is 600, while the sum is 26.
The square root of 151813151 is about 12321.2479481585. The cubic root of 151813151 is about 533.4615610518.
The spelling of 151813151 in words is "one hundred fifty-one million, eight hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •