Base | Representation |
---|---|
bin | 1000010100110000001… |
… | …1110111100100011110 |
3 | 111200010121112212221022 |
4 | 2011030003313210132 |
5 | 4320341030100410 |
6 | 145410424404142 |
7 | 13221630653633 |
oct | 2051403674436 |
9 | 450117485838 |
10 | 143010003230 |
11 | 55717467116 |
12 | 23871916652 |
13 | 106413696b3 |
14 | 6cc92ba18a |
15 | 3ac00de455 |
hex | 214c0f791e |
143010003230 has 8 divisors (see below), whose sum is σ = 257418005832. Its totient is φ = 57204001288.
The previous prime is 143010003203. The next prime is 143010003233. The reversal of 143010003230 is 32300010341.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1430100032302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 143010003199 and 143010003208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143010003233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7150500152 + ... + 7150500171.
It is an arithmetic number, because the mean of its divisors is an integer number (32177250729).
Almost surely, 2143010003230 is an apocalyptic number.
143010003230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143010003230 is a deficient number, since it is larger than the sum of its proper divisors (114408002602).
143010003230 is a wasteful number, since it uses less digits than its factorization.
143010003230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14301000330.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 143010003230 its reverse (32300010341), we get a palindrome (175310013571).
The spelling of 143010003230 in words is "one hundred forty-three billion, ten million, three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •