Base | Representation |
---|---|
bin | 10010000000001… |
… | …10101000000001 |
3 | 101112011201100102 |
4 | 21000012220001 |
5 | 302130201311 |
6 | 22552532145 |
7 | 3512444420 |
oct | 1100065001 |
9 | 345151312 |
10 | 151022081 |
11 | 78280141 |
12 | 426b1055 |
13 | 253991a2 |
14 | 160b32b7 |
15 | d3d243b |
hex | 9006a01 |
151022081 has 4 divisors (see below), whose sum is σ = 172596672. Its totient is φ = 129447492.
The previous prime is 151022057. The next prime is 151022083. The reversal of 151022081 is 180220151.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 151022081 - 218 = 150759937 is a prime.
It is a super-3 number, since 3×1510220813 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151022083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10787285 + ... + 10787298.
It is an arithmetic number, because the mean of its divisors is an integer number (43149168).
Almost surely, 2151022081 is an apocalyptic number.
It is an amenable number.
151022081 is a deficient number, since it is larger than the sum of its proper divisors (21574591).
151022081 is an equidigital number, since it uses as much as digits as its factorization.
151022081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21574590.
The product of its (nonzero) digits is 160, while the sum is 20.
The square root of 151022081 is about 12289.1041577488. The cubic root of 151022081 is about 532.5333573996.
The spelling of 151022081 in words is "one hundred fifty-one million, twenty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •