Base | Representation |
---|---|
bin | 1000010101101100110… |
… | …0110101101111010110 |
3 | 111200210022111221012120 |
4 | 2011123030311233112 |
5 | 4321401041411040 |
6 | 145451541000410 |
7 | 13231134006660 |
oct | 2053314655726 |
9 | 450708457176 |
10 | 143264013270 |
11 | 55837889674 |
12 | 239229b3106 |
13 | 10681b843b1 |
14 | 6d10d1b530 |
15 | 3ad75667d0 |
hex | 215b335bd6 |
143264013270 has 128 divisors (see below), whose sum is σ = 400656098304. Its totient is φ = 32105009664.
The previous prime is 143264013257. The next prime is 143264013311. The reversal of 143264013270 is 72310462341.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18839289 + ... + 18846891.
It is an arithmetic number, because the mean of its divisors is an integer number (3130125768).
Almost surely, 2143264013270 is an apocalyptic number.
143264013270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 143264013270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200328049152).
143264013270 is an abundant number, since it is smaller than the sum of its proper divisors (257392085034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143264013270 is a wasteful number, since it uses less digits than its factorization.
143264013270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9366.
The product of its (nonzero) digits is 24192, while the sum is 33.
The spelling of 143264013270 in words is "one hundred forty-three billion, two hundred sixty-four million, thirteen thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •