Base | Representation |
---|---|
bin | 1000010110010000010… |
… | …1111110110001110111 |
3 | 111201011201020220221221 |
4 | 2011210011332301313 |
5 | 4322202240211411 |
6 | 145514430451211 |
7 | 13234625113354 |
oct | 2054405766167 |
9 | 451151226857 |
10 | 143413210231 |
11 | 55904022545 |
12 | 23964963b07 |
13 | 106a6a61915 |
14 | 6d26a7762b |
15 | 3ae56d8071 |
hex | 216417ec77 |
143413210231 has 4 divisors (see below), whose sum is σ = 146119119912. Its totient is φ = 140707300552.
The previous prime is 143413210223. The next prime is 143413210267. The reversal of 143413210231 is 132012314341.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 143413210231 - 23 = 143413210223 is a prime.
It is a super-2 number, since 2×1434132102312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143413210196 and 143413210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143413210211) 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, 1352954761 + ... + 1352954866.
It is an arithmetic number, because the mean of its divisors is an integer number (36529779978).
Almost surely, 2143413210231 is an apocalyptic number.
143413210231 is a deficient number, since it is larger than the sum of its proper divisors (2705909681).
143413210231 is an equidigital number, since it uses as much as digits as its factorization.
143413210231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2705909680.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 143413210231 its reverse (132012314341), we get a palindrome (275425524572).
The spelling of 143413210231 in words is "one hundred forty-three billion, four hundred thirteen million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •