Base | Representation |
---|---|
bin | 100000101010000110001001… |
… | …111110101011000100000101 |
3 | 200211112220221200202010002012 |
4 | 200222012021332223010011 |
5 | 122311214341430102240 |
6 | 1225250504551224005 |
7 | 42152643063222560 |
oct | 4052061176530405 |
9 | 624486850663065 |
10 | 143630316253445 |
11 | 418463030aa42a |
12 | 14138626378005 |
13 | 621b3859319b8 |
14 | 2767a5c8b74d7 |
15 | 119124a346b65 |
hex | 82a189fab105 |
143630316253445 has 32 divisors (see below), whose sum is σ = 197198238838272. Its totient is φ = 98379647131392.
The previous prime is 143630316253441. The next prime is 143630316253499. The reversal of 143630316253445 is 544352613036341.
It is a cyclic number.
It is not a de Polignac number, because 143630316253445 - 22 = 143630316253441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143630316253393 and 143630316253402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143630316253441) 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, 146533199 + ... + 147510131.
It is an arithmetic number, because the mean of its divisors is an integer number (6162444963696).
Almost surely, 2143630316253445 is an apocalyptic number.
It is an amenable number.
143630316253445 is a deficient number, since it is larger than the sum of its proper divisors (53567922584827).
143630316253445 is a wasteful number, since it uses less digits than its factorization.
143630316253445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 981621.
The product of its (nonzero) digits is 9331200, while the sum is 50.
Adding to 143630316253445 its reverse (544352613036341), we get a palindrome (687982929289786).
The spelling of 143630316253445 in words is "one hundred forty-three trillion, six hundred thirty billion, three hundred sixteen million, two hundred fifty-three thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •