Base | Representation |
---|---|
bin | 11100001101011101… |
… | …00011011011000001 |
3 | 1110002111110112201110 |
4 | 32012232203123001 |
5 | 222004141040140 |
6 | 10542503153533 |
7 | 1044212344143 |
oct | 160656433301 |
9 | 43074415643 |
10 | 15145252545 |
11 | 6472111445 |
12 | 2b281458a9 |
13 | 15749750c7 |
14 | a39634c93 |
15 | 5d9957380 |
hex | 386ba36c1 |
15145252545 has 32 divisors (see below), whose sum is σ = 25660615680. Its totient is φ = 7606491840.
The previous prime is 15145252541. The next prime is 15145252559. The reversal of 15145252545 is 54525254151.
It is a happy number.
15145252545 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 15145252545 - 22 = 15145252541 is a prime.
It is a super-3 number, since 3×151452525453 (a number of 32 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (15145252541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111511 + ... + 206700.
It is an arithmetic number, because the mean of its divisors is an integer number (801894240).
Almost surely, 215145252545 is an apocalyptic number.
15145252545 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
15145252545 is a deficient number, since it is larger than the sum of its proper divisors (10515363135).
15145252545 is a wasteful number, since it uses less digits than its factorization.
15145252545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318405.
The product of its digits is 200000, while the sum is 39.
The spelling of 15145252545 in words is "fifteen billion, one hundred forty-five million, two hundred fifty-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •