Base | Representation |
---|---|
bin | 1000110111010111011… |
… | …0101111110010011001 |
3 | 112120010010110121002101 |
4 | 2031311312233302121 |
5 | 4443403043004040 |
6 | 153544410003401 |
7 | 14001110224366 |
oct | 2156566576231 |
9 | 476103417071 |
10 | 152301141145 |
11 | 5965502959a |
12 | 25625416561 |
13 | 11492233b3a |
14 | 752b23946d |
15 | 3e65b2909a |
hex | 2375dafc99 |
152301141145 has 8 divisors (see below), whose sum is σ = 185335473600. Its totient is φ = 120124843440.
The previous prime is 152301141131. The next prime is 152301141149. The reversal of 152301141145 is 541141103251.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 152301141145 - 27 = 152301141017 is a prime.
It is a super-2 number, since 2×1523011411452 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (152301141149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 214508295 + ... + 214509004.
It is an arithmetic number, because the mean of its divisors is an integer number (23166934200).
Almost surely, 2152301141145 is an apocalyptic number.
It is an amenable number.
152301141145 is a deficient number, since it is larger than the sum of its proper divisors (33034332455).
152301141145 is an equidigital number, since it uses as much as digits as its factorization.
152301141145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429017375.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 152301141145 its reverse (541141103251), we get a palindrome (693442244396).
The spelling of 152301141145 in words is "one hundred fifty-two billion, three hundred one million, one hundred forty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •