Base | Representation |
---|---|
bin | 1000110111011010011… |
… | …1110100100010001001 |
3 | 112120011000200011212012 |
4 | 2031312213310202021 |
5 | 4443414341140031 |
6 | 153545545425305 |
7 | 14001324454250 |
oct | 2156647644211 |
9 | 476130604765 |
10 | 152314005641 |
11 | 59661315906 |
12 | 2562979b235 |
13 | 11494ab9475 |
14 | 752cc27797 |
15 | 3e66d1ab2b |
hex | 23769f4889 |
152314005641 has 16 divisors (see below), whose sum is σ = 174374027520. Its totient is φ = 130329380160.
The previous prime is 152314005637. The next prime is 152314005659. The reversal of 152314005641 is 146500413251.
152314005641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 152314005641 - 22 = 152314005637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152314005598 and 152314005607.
It is not an unprimeable number, because it can be changed into a prime (152314005601) 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, 13038095 + ... + 13049771.
It is an arithmetic number, because the mean of its divisors is an integer number (10898376720).
Almost surely, 2152314005641 is an apocalyptic number.
It is an amenable number.
152314005641 is a deficient number, since it is larger than the sum of its proper divisors (22060021879).
152314005641 is a wasteful number, since it uses less digits than its factorization.
152314005641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14744.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 152314005641 its reverse (146500413251), we get a palindrome (298814418892).
The spelling of 152314005641 in words is "one hundred fifty-two billion, three hundred fourteen million, five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •