Base | Representation |
---|---|
bin | 1000010101000110000… |
… | …0101001101000100001 |
3 | 111200100222121001220222 |
4 | 2011101200221220201 |
5 | 4321032431400101 |
6 | 145423452212425 |
7 | 13224121060052 |
oct | 2052140515041 |
9 | 450328531828 |
10 | 143101434401 |
11 | 55764035772 |
12 | 2389846a115 |
13 | 1065729cb93 |
14 | 6cd74ba729 |
15 | 3ac815001b |
hex | 2151829a21 |
143101434401 has 2 divisors, whose sum is σ = 143101434402. Its totient is φ = 143101434400.
The previous prime is 143101434391. The next prime is 143101434433. The reversal of 143101434401 is 104434101341.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 142884756001 + 216678400 = 378001^2 + 14720^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143101434401 is a prime.
It is a super-3 number, since 3×1431014344013 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (143101434481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71550717200 + 71550717201.
It is an arithmetic number, because the mean of its divisors is an integer number (71550717201).
Almost surely, 2143101434401 is an apocalyptic number.
It is an amenable number.
143101434401 is a deficient number, since it is larger than the sum of its proper divisors (1).
143101434401 is an equidigital number, since it uses as much as digits as its factorization.
143101434401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 143101434401 its reverse (104434101341), we get a palindrome (247535535742).
The spelling of 143101434401 in words is "one hundred forty-three billion, one hundred one million, four hundred thirty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •