Base | Representation |
---|---|
bin | 1000010101101101010… |
… | …1111101111010100100 |
3 | 111200210111000111111010 |
4 | 2011123111331322210 |
5 | 4321402144443202 |
6 | 145452104142220 |
7 | 13231163234010 |
oct | 2053325757244 |
9 | 450714014433 |
10 | 143266406052 |
11 | 55839173380 |
12 | 23923767970 |
13 | 10682511543 |
14 | 6d11381540 |
15 | 3ad788a76c |
hex | 215b57dea4 |
143266406052 has 96 divisors (see below), whose sum is σ = 416936024064. Its totient is φ = 37197676800.
The previous prime is 143266406051. The next prime is 143266406053. The reversal of 143266406052 is 250604662341.
It is an interprime number because it is at equal distance from previous prime (143266406051) and next prime (143266406053).
It is a self number, because there is not a number n which added to its sum of digits gives 143266406052.
It is not an unprimeable number, because it can be changed into a prime (143266406051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2476368 + ... + 2533560.
It is an arithmetic number, because the mean of its divisors is an integer number (4343083584).
Almost surely, 2143266406052 is an apocalyptic number.
143266406052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
143266406052 is an abundant number, since it is smaller than the sum of its proper divisors (273669618012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143266406052 is a wasteful number, since it uses less digits than its factorization.
143266406052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59929 (or 59927 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 39.
The spelling of 143266406052 in words is "one hundred forty-three billion, two hundred sixty-six million, four hundred six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •