Base | Representation |
---|---|
bin | 1000010101100111000… |
… | …1010010010011101001 |
3 | 111200201122100121001220 |
4 | 2011121301102103221 |
5 | 4321323420404113 |
6 | 145445322332253 |
7 | 13230423010305 |
oct | 2053161222351 |
9 | 450648317056 |
10 | 143240013033 |
11 | 55825286967 |
12 | 2391695a089 |
13 | 10679c00280 |
14 | 6d0ba70d05 |
15 | 3ad53c5523 |
hex | 2159c524e9 |
143240013033 has 16 divisors (see below), whose sum is σ = 205685530176. Its totient is φ = 88144459200.
The previous prime is 143240013017. The next prime is 143240013097. The reversal of 143240013033 is 330310042341.
It is not a de Polignac number, because 143240013033 - 24 = 143240013017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143240012994 and 143240013012.
It is not an unprimeable number, because it can be changed into a prime (143240063033) 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 15 ways as a sum of consecutive naturals, for example, 1423483 + ... + 1520783.
It is an arithmetic number, because the mean of its divisors is an integer number (12855345636).
Almost surely, 2143240013033 is an apocalyptic number.
143240013033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
143240013033 is a deficient number, since it is larger than the sum of its proper divisors (62445517143).
143240013033 is a wasteful number, since it uses less digits than its factorization.
143240013033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135064.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 143240013033 its reverse (330310042341), we get a palindrome (473550055374).
The spelling of 143240013033 in words is "one hundred forty-three billion, two hundred forty million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •