Base | Representation |
---|---|
bin | 1000110100111100110… |
… | …0110010110111000100 |
3 | 112111102221010202212221 |
4 | 2031033030302313010 |
5 | 4441041032000401 |
6 | 153400201422124 |
7 | 13646043624454 |
oct | 2151714626704 |
9 | 474387122787 |
10 | 151652609476 |
11 | 59351a43105 |
12 | 2548419a944 |
13 | 113baa752a4 |
14 | 74a905bd64 |
15 | 3e28c217a1 |
hex | 234f332dc4 |
151652609476 has 9 divisors (see below), whose sum is σ = 265393429581. Its totient is φ = 75825915312.
The previous prime is 151652609473. The next prime is 151652609477. The reversal of 151652609476 is 674906256151.
It is a happy number.
The square root of 151652609476 is 389426.
It is a perfect power (a square), and thus also a powerful number.
151652609476 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 43953122500 + 107699486976 = 209650^2 + 328176^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151652609473) 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 2 ways as a sum of consecutive naturals, for example, 681496 + ... + 876208.
Almost surely, 2151652609476 is an apocalyptic number.
151652609476 is the 389426-th square number.
It is an amenable number.
151652609476 is a deficient number, since it is larger than the sum of its proper divisors (113740820105).
151652609476 is an frugal number, since it uses more digits than its factorization.
151652609476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389430 (or 194715 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 52.
The spelling of 151652609476 in words is "one hundred fifty-one billion, six hundred fifty-two million, six hundred nine thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •