Base | Representation |
---|---|
bin | 100000100111001011101100… |
… | …111000011100111001110011 |
3 | 200210211210012010022120021010 |
4 | 200213023230320130321303 |
5 | 122244424332144312201 |
6 | 1225014514525402003 |
7 | 42132324613100043 |
oct | 4047135470347163 |
9 | 623753163276233 |
10 | 143430112104051 |
11 | 41779407081823 |
12 | 14105872409303 |
13 | 620552b234986 |
14 | 275c0a9653723 |
15 | 118ae2dee8bd6 |
hex | 8272ece1ce73 |
143430112104051 has 8 divisors (see below), whose sum is σ = 191240253710784. Its totient is φ = 95620022616680.
The previous prime is 143430112104049. The next prime is 143430112104073. The reversal of 143430112104051 is 150401211034341.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 143430112104051 - 21 = 143430112104049 is a prime.
It is a super-2 number, since 2×1434301121040512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (143430112104001) 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, 6078885 + ... + 17994806.
It is an arithmetic number, because the mean of its divisors is an integer number (23905031713848).
Almost surely, 2143430112104051 is an apocalyptic number.
143430112104051 is a deficient number, since it is larger than the sum of its proper divisors (47810141606733).
143430112104051 is a wasteful number, since it uses less digits than its factorization.
143430112104051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26059681.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 143430112104051 its reverse (150401211034341), we get a palindrome (293831323138392).
The spelling of 143430112104051 in words is "one hundred forty-three trillion, four hundred thirty billion, one hundred twelve million, one hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •