Base | Representation |
---|---|
bin | 1101101011101111111001… |
… | …0000011110111100111110 |
3 | 1222021022101201122200201210 |
4 | 3122323332100132330332 |
5 | 3433000123222021132 |
6 | 51555404405345250 |
7 | 3111661050115113 |
oct | 332737620367476 |
9 | 58238351580653 |
10 | 15045241204542 |
11 | 488071848211a |
12 | 182ba50a08226 |
13 | 8519b60b3ab3 |
14 | 3a029d1b090a |
15 | 1b156434abcc |
hex | daefe41ef3e |
15045241204542 has 32 divisors (see below), whose sum is σ = 30149326091808. Its totient is φ = 5005277669376.
The previous prime is 15045241204537. The next prime is 15045241204601. The reversal of 15045241204542 is 24540214254051.
It is a super-2 number, since 2×150452412045422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15045241204542.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12715638 + ... + 13848390.
It is an arithmetic number, because the mean of its divisors is an integer number (942166440369).
Almost surely, 215045241204542 is an apocalyptic number.
15045241204542 is an abundant number, since it is smaller than the sum of its proper divisors (15104084887266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15045241204542 is a wasteful number, since it uses less digits than its factorization.
15045241204542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137084.
The product of its (nonzero) digits is 256000, while the sum is 39.
Adding to 15045241204542 its reverse (24540214254051), we get a palindrome (39585455458593).
The spelling of 15045241204542 in words is "fifteen trillion, forty-five billion, two hundred forty-one million, two hundred four thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •