Base | Representation |
---|---|
bin | 111110100110000111… |
… | …1100011000100100011 |
3 | 110211222011211112212101 |
4 | 1331030033203010203 |
5 | 4200244310133103 |
6 | 141430402111231 |
7 | 12466062520162 |
oct | 1751417430443 |
9 | 424864745771 |
10 | 134423130403 |
11 | 52010397501 |
12 | 2207604b517 |
13 | c8a3375a63 |
14 | 6712ac53d9 |
15 | 376b31aa1d |
hex | 1f4c3e3123 |
134423130403 has 8 divisors (see below), whose sum is σ = 138768266240. Its totient is φ = 130078551240.
The previous prime is 134423130397. The next prime is 134423130409. The reversal of 134423130403 is 304031324431.
It is an interprime number because it is at equal distance from previous prime (134423130397) and next prime (134423130409).
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 134423130403 - 233 = 125833195811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134423130409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 382708 + ... + 644446.
It is an arithmetic number, because the mean of its divisors is an integer number (17346033280).
Almost surely, 2134423130403 is an apocalyptic number.
134423130403 is a deficient number, since it is larger than the sum of its proper divisors (4345135837).
134423130403 is a wasteful number, since it uses less digits than its factorization.
134423130403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278337.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 134423130403 its reverse (304031324431), we get a palindrome (438454454834).
The spelling of 134423130403 in words is "one hundred thirty-four billion, four hundred twenty-three million, one hundred thirty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •