Base | Representation |
---|---|
bin | 10001000011001… |
… | …10001101101001 |
3 | 100222010102102021 |
4 | 20201212031221 |
5 | 243103300001 |
6 | 22105304441 |
7 | 3354456340 |
oct | 1041461551 |
9 | 328112367 |
10 | 143025001 |
11 | 73808889 |
12 | 3ba95121 |
13 | 238291a2 |
14 | 14dd0b57 |
15 | c852ba1 |
hex | 8866369 |
143025001 has 4 divisors (see below), whose sum is σ = 163457152. Its totient is φ = 122592852.
The previous prime is 143024993. The next prime is 143025007. The reversal of 143025001 is 100520341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 100520341 = 181 ⋅555361.
It is a cyclic number.
It is not a de Polignac number, because 143025001 - 23 = 143024993 is a prime.
It is a super-2 number, since 2×1430250012 = 40912301822100002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143025007) 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, 10216065 + ... + 10216078.
It is an arithmetic number, because the mean of its divisors is an integer number (40864288).
Almost surely, 2143025001 is an apocalyptic number.
It is an amenable number.
143025001 is a deficient number, since it is larger than the sum of its proper divisors (20432151).
143025001 is an equidigital number, since it uses as much as digits as its factorization.
143025001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20432150.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 143025001 is about 11959.3060417400. The cubic root of 143025001 is about 522.9626265204.
Adding to 143025001 its reverse (100520341), we get a palindrome (243545342).
The spelling of 143025001 in words is "one hundred forty-three million, twenty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •