Base | Representation |
---|---|
bin | 1000110110011111001… |
… | …0110001001000101011 |
3 | 112112111200112102002120 |
4 | 2031213302301020223 |
5 | 4442412143421232 |
6 | 153505141202323 |
7 | 13662214006161 |
oct | 2154762611053 |
9 | 475450472076 |
10 | 152065217067 |
11 | 5954393a315 |
12 | 2557a4003a3 |
13 | 114553ac2aa |
14 | 7507b85231 |
15 | 3e5007592c |
hex | 2367cb122b |
152065217067 has 16 divisors (see below), whose sum is σ = 209068086528. Its totient is φ = 98265670880.
The previous prime is 152065217041. The next prime is 152065217081. The reversal of 152065217067 is 760712560251.
It is a happy number.
152065217067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 152065217067 - 27 = 152065216939 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (152065217027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5748159 + ... + 5774552.
It is an arithmetic number, because the mean of its divisors is an integer number (13066755408).
Almost surely, 2152065217067 is an apocalyptic number.
152065217067 is a deficient number, since it is larger than the sum of its proper divisors (57002869461).
152065217067 is a wasteful number, since it uses less digits than its factorization.
152065217067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11522850.
The product of its (nonzero) digits is 176400, while the sum is 42.
The spelling of 152065217067 in words is "one hundred fifty-two billion, sixty-five million, two hundred seventeen thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •