Base | Representation |
---|---|
bin | 100000100010110000101011… |
… | …001001001101011101001001 |
3 | 200202202201202221102200002101 |
4 | 200202300223021031131021 |
5 | 122224434441241202401 |
6 | 1224223135222433401 |
7 | 42101346002635660 |
oct | 4042605311153511 |
9 | 622681687380071 |
10 | 143126214006601 |
11 | 41671539572191 |
12 | 1407699b592861 |
13 | 61b2989943137 |
14 | 274b4ba925dd7 |
15 | 11830944e3101 |
hex | 822c2b24d749 |
143126214006601 has 8 divisors (see below), whose sum is σ = 165543572827584. Its totient is φ = 121201544390640.
The previous prime is 143126214006593. The next prime is 143126214006623. The reversal of 143126214006601 is 106600412621341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143126214006601 - 23 = 143126214006593 is a prime.
It is a super-2 number, since 2×1431262140066012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (143126214006691) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 123172300630 + ... + 123172301791.
It is an arithmetic number, because the mean of its divisors is an integer number (20692946603448).
Almost surely, 2143126214006601 is an apocalyptic number.
It is an amenable number.
143126214006601 is a deficient number, since it is larger than the sum of its proper divisors (22417358820983).
143126214006601 is an equidigital number, since it uses as much as digits as its factorization.
143126214006601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246344602511.
The product of its (nonzero) digits is 41472, while the sum is 37.
Adding to 143126214006601 its reverse (106600412621341), we get a palindrome (249726626627942).
The spelling of 143126214006601 in words is "one hundred forty-three trillion, one hundred twenty-six billion, two hundred fourteen million, six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •