Base | Representation |
---|---|
bin | 10010000000011… |
… | …10110000110110 |
3 | 101112020102001222 |
4 | 21000032300312 |
5 | 302132233124 |
6 | 22553350342 |
7 | 3512643536 |
oct | 1100166066 |
9 | 345212058 |
10 | 151055414 |
11 | 782a3194 |
12 | 427083b2 |
13 | 253ab403 |
14 | 160c14c6 |
15 | d3dc25e |
hex | 900ec36 |
151055414 has 8 divisors (see below), whose sum is σ = 226740360. Its totient is φ = 75475296.
The previous prime is 151055413. The next prime is 151055441. The reversal of 151055414 is 414550151.
151055414 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1510554142 = 45635476197422792, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151055413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22499 + ... + 28430.
It is an arithmetic number, because the mean of its divisors is an integer number (28342545).
Almost surely, 2151055414 is an apocalyptic number.
151055414 is a deficient number, since it is larger than the sum of its proper divisors (75684946).
151055414 is a wasteful number, since it uses less digits than its factorization.
151055414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52414.
The product of its (nonzero) digits is 2000, while the sum is 26.
The square root of 151055414 is about 12290.4602843018. The cubic root of 151055414 is about 532.5725340738.
It can be divided in two parts, 1510554 and 14, that multiplied together give a triangular number (21147756 = T6503).
The spelling of 151055414 in words is "one hundred fifty-one million, fifty-five thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •