Base | Representation |
---|---|
bin | 11110100011110100111101… |
… | …011101001011010100000111 |
3 | 122121212211210000020020000002 |
4 | 132203310331131023110013 |
5 | 120104031222304334143 |
6 | 1153504031132111515 |
7 | 40211220413526260 |
oct | 3643647535132407 |
9 | 577784700206002 |
10 | 134403442652423 |
11 | 399091a853998a |
12 | 130a835500559b |
13 | 59cc261cc9999 |
14 | 25292389b1967 |
15 | 108121e2cc5b8 |
hex | 7a3d3d74b507 |
134403442652423 has 16 divisors (see below), whose sum is σ = 156891961027584. Its totient is φ = 112737551474400.
The previous prime is 134403442652393. The next prime is 134403442652431. The reversal of 134403442652423 is 324256244304431.
It is a cyclic number.
It is not a de Polignac number, because 134403442652423 - 224 = 134403425875207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134403442652123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23253065 + ... + 28451922.
It is an arithmetic number, because the mean of its divisors is an integer number (9805747564224).
Almost surely, 2134403442652423 is an apocalyptic number.
134403442652423 is a deficient number, since it is larger than the sum of its proper divisors (22488518375161).
134403442652423 is an equidigital number, since it uses as much as digits as its factorization.
134403442652423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51712942.
The product of its (nonzero) digits is 6635520, while the sum is 47.
Adding to 134403442652423 its reverse (324256244304431), we get a palindrome (458659686956854).
The spelling of 134403442652423 in words is "one hundred thirty-four trillion, four hundred three billion, four hundred forty-two million, six hundred fifty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •