Base | Representation |
---|---|
bin | 1000110100011100010… |
… | …0001101001000001101 |
3 | 112111002102100102000120 |
4 | 2031013010031020031 |
5 | 4440301112440140 |
6 | 153334444415153 |
7 | 13642465640424 |
oct | 2150704151015 |
9 | 474072312016 |
10 | 151516140045 |
11 | 59291a02656 |
12 | 254465474b9 |
13 | 11398702c4a |
14 | 7494c962bb |
15 | 3e1bc661d0 |
hex | 234710d20d |
151516140045 has 8 divisors (see below), whose sum is σ = 242425824096. Its totient is φ = 80808608016.
The previous prime is 151516140031. The next prime is 151516140077. The reversal of 151516140045 is 540041615151.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 151516140045 - 216 = 151516074509 is a prime.
It is a super-3 number, since 3×1515161400453 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 151516139988 and 151516140015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5050537987 + ... + 5050538016.
It is an arithmetic number, because the mean of its divisors is an integer number (30303228012).
Almost surely, 2151516140045 is an apocalyptic number.
151516140045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
151516140045 is a deficient number, since it is larger than the sum of its proper divisors (90909684051).
151516140045 is a wasteful number, since it uses less digits than its factorization.
151516140045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10101076011.
The product of its (nonzero) digits is 12000, while the sum is 33.
Adding to 151516140045 its reverse (540041615151), we get a palindrome (691557755196).
The spelling of 151516140045 in words is "one hundred fifty-one billion, five hundred sixteen million, one hundred forty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •