Base | Representation |
---|---|
bin | 1011111101101100010111… |
… | …1010100110001001111110 |
3 | 1201120120002102221200020110 |
4 | 2333123011322212021332 |
5 | 3211010414121120132 |
6 | 43551033145130450 |
7 | 2525245012636245 |
oct | 277330572461176 |
9 | 51516072850213 |
10 | 13154510332542 |
11 | 42118841664a7 |
12 | 1585522a89a26 |
13 | 7456077bb3a7 |
14 | 33697881195c |
15 | 17c2a41e61cc |
hex | bf6c5ea627e |
13154510332542 has 16 divisors (see below), whose sum is σ = 26316918940032. Its totient is φ = 4383520398360.
The previous prime is 13154510332541. The next prime is 13154510332583. The reversal of 13154510332542 is 24523301545131.
It is a super-2 number, since 2×131545103325422 (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 13154510332542.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13154510332541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 329073138 + ... + 329113109.
It is an arithmetic number, because the mean of its divisors is an integer number (1644807433752).
Almost surely, 213154510332542 is an apocalyptic number.
13154510332542 is an abundant number, since it is smaller than the sum of its proper divisors (13162408607490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13154510332542 is a wasteful number, since it uses less digits than its factorization.
13154510332542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658189583.
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 13154510332542 its reverse (24523301545131), we get a palindrome (37677811877673).
The spelling of 13154510332542 in words is "thirteen trillion, one hundred fifty-four billion, five hundred ten million, three hundred thirty-two thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •