Base | Representation |
---|---|
bin | 100000100101011101111001… |
… | …111110101001001000111001 |
3 | 200210102111220000221212011222 |
4 | 200211131321332221020321 |
5 | 122241011411334331301 |
6 | 1224444420341401425 |
7 | 42120652262515031 |
oct | 4045357176511071 |
9 | 623374800855158 |
10 | 143312220230201 |
11 | 4173340a1a6020 |
12 | 140a6a50709275 |
13 | 61c7390a22139 |
14 | 27564c42b08c1 |
15 | 1187d2e16331b |
hex | 825779fa9239 |
143312220230201 has 32 divisors (see below), whose sum is σ = 157963682169216. Its totient is φ = 128936912832000.
The previous prime is 143312220230063. The next prime is 143312220230203. The reversal of 143312220230201 is 102032022213341.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143312220230201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (143312220230203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1791429935 + ... + 1791509931.
It is an arithmetic number, because the mean of its divisors is an integer number (4936365067788).
Almost surely, 2143312220230201 is an apocalyptic number.
143312220230201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
143312220230201 is a deficient number, since it is larger than the sum of its proper divisors (14651461939015).
143312220230201 is a wasteful number, since it uses less digits than its factorization.
143312220230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83513.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 143312220230201 its reverse (102032022213341), we get a palindrome (245344242443542).
The spelling of 143312220230201 in words is "one hundred forty-three trillion, three hundred twelve billion, two hundred twenty million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •