Base | Representation |
---|---|
bin | 100000100001000110100000… |
… | …000111100110101101000011 |
3 | 200202100211111222022011112221 |
4 | 200201012200013212231003 |
5 | 122221103002333344021 |
6 | 1224054523044431511 |
7 | 42060201641202520 |
oct | 4041064007465503 |
9 | 622324458264487 |
10 | 143012212403011 |
11 | 41628158643076 |
12 | 140588846a8597 |
13 | 61a4cbc3b2973 |
14 | 2745b840d2147 |
15 | 1180120e5a241 |
hex | 8211a01e6b43 |
143012212403011 has 4 divisors (see below), whose sum is σ = 163442528460592. Its totient is φ = 122581896345432.
The previous prime is 143012212402999. The next prime is 143012212403069. The reversal of 143012212403011 is 110304212210341.
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 143012212403011 - 27 = 143012212402883 is a prime.
It is a super-2 number, since 2×1430122124030112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143012212403311) 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, 10215158028780 + ... + 10215158028793.
It is an arithmetic number, because the mean of its divisors is an integer number (40860632115148).
Almost surely, 2143012212403011 is an apocalyptic number.
143012212403011 is a deficient number, since it is larger than the sum of its proper divisors (20430316057581).
143012212403011 is an equidigital number, since it uses as much as digits as its factorization.
143012212403011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20430316057580.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 143012212403011 its reverse (110304212210341), we get a palindrome (253316424613352).
The spelling of 143012212403011 in words is "one hundred forty-three trillion, twelve billion, two hundred twelve million, four hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •