Base | Representation |
---|---|
bin | 1000010101101100001… |
… | …1000100111011011101 |
3 | 111200210010200220121110 |
4 | 2011123003010323131 |
5 | 4321344413012140 |
6 | 145451410052233 |
7 | 13231103160453 |
oct | 2053303047335 |
9 | 450703626543 |
10 | 143261454045 |
11 | 558363a0906 |
12 | 23921b7a079 |
13 | 10681499568 |
14 | 6d108529d3 |
15 | 3ad720d380 |
hex | 215b0c4edd |
143261454045 has 16 divisors (see below), whose sum is σ = 231979995072. Its totient is φ = 75485552640.
The previous prime is 143261453999. The next prime is 143261454109. The reversal of 143261454045 is 540454162341.
143261454045 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 143261454045 - 216 = 143261388509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143261453994 and 143261454012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57533476 + ... + 57535965.
It is an arithmetic number, because the mean of its divisors is an integer number (14498749692).
Almost surely, 2143261454045 is an apocalyptic number.
143261454045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
143261454045 is a deficient number, since it is larger than the sum of its proper divisors (88718541027).
143261454045 is a wasteful number, since it uses less digits than its factorization.
143261454045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115069532.
The product of its (nonzero) digits is 230400, while the sum is 39.
The spelling of 143261454045 in words is "one hundred forty-three billion, two hundred sixty-one million, four hundred fifty-four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •