Base | Representation |
---|---|
bin | 1100010100011011100110… |
… | …0000010111100110100011 |
3 | 1202221220101101101220102101 |
4 | 3011012321200113212203 |
5 | 3233410423400421111 |
6 | 44450315303431231 |
7 | 2565414204431653 |
oct | 305067140274643 |
9 | 52856341356371 |
10 | 13545144154531 |
11 | 4352510832710 |
12 | 1629181455517 |
13 | 7733bc84a662 |
14 | 34b834ac0363 |
15 | 1875186d0bc1 |
hex | c51b98179a3 |
13545144154531 has 8 divisors (see below), whose sum is σ = 14779881540144. Its totient is φ = 12310966876320.
The previous prime is 13545144154519. The next prime is 13545144154561.
13545144154531 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13545144154531 - 231 = 13542996670883 is a prime.
It is a super-2 number, since 2×135451441545312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13545144154561) 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, 139976280 + ... + 140073013.
It is an arithmetic number, because the mean of its divisors is an integer number (1847485192518).
Almost surely, 213545144154531 is an apocalyptic number.
13545144154531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13545144154531 is a deficient number, since it is larger than the sum of its proper divisors (1234737385613).
13545144154531 is a wasteful number, since it uses less digits than its factorization.
13545144154531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280053701.
The product of its digits is 1440000, while the sum is 46.
The spelling of 13545144154531 in words is "thirteen trillion, five hundred forty-five billion, one hundred forty-four million, one hundred fifty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •