Base | Representation |
---|---|
bin | 1001001101111000000110… |
… | …0110001011111011001011 |
3 | 1022212210122000212101100100 |
4 | 2103132001212023323023 |
5 | 2312013414020404233 |
6 | 33315255111340443 |
7 | 2064105006525153 |
oct | 223360146137313 |
9 | 38783560771310 |
10 | 10134002122443 |
11 | 3257896006a61 |
12 | 1178054981723 |
13 | 58682b215834 |
14 | 2706b9d41763 |
15 | 12891e2ea813 |
hex | 9378198becb |
10134002122443 has 12 divisors (see below), whose sum is σ = 14802475011480. Its totient is φ = 6680091286176.
The previous prime is 10134002122429. The next prime is 10134002122469. The reversal of 10134002122443 is 34422120043101.
10134002122443 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 4 + 0 + 0 + 212 + 2 + 443 = 666.
It is not a de Polignac number, because 10134002122443 - 24 = 10134002122427 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10134002172443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6325843221 + ... + 6325844822.
It is an arithmetic number, because the mean of its divisors is an integer number (1233539584290).
Almost surely, 210134002122443 is an apocalyptic number.
10134002122443 is a deficient number, since it is larger than the sum of its proper divisors (4668472889037).
10134002122443 is a wasteful number, since it uses less digits than its factorization.
10134002122443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12651688138 (or 12651688135 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 10134002122443 its reverse (34422120043101), we get a palindrome (44556122165544).
The spelling of 10134002122443 in words is "ten trillion, one hundred thirty-four billion, two million, one hundred twenty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •