Base | Representation |
---|---|
bin | 11110100010010100110101… |
… | …100001110110000100111001 |
3 | 122121111222100222020202020220 |
4 | 132202110311201312010321 |
5 | 120100333332443141241 |
6 | 1153344401340210253 |
7 | 40200604623320535 |
oct | 3642246541660471 |
9 | 577458328222226 |
10 | 134300230443321 |
11 | 39879453981618 |
12 | 1309034b539989 |
13 | 59c25c3b654c7 |
14 | 25242470a8bc5 |
15 | 107d6cd082166 |
hex | 7a2535876139 |
134300230443321 has 16 divisors (see below), whose sum is σ = 180117083782080. Its totient is φ = 89008518474560.
The previous prime is 134300230443319. The next prime is 134300230443329. The reversal of 134300230443321 is 123344032003431.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 134300230443321 - 21 = 134300230443319 is a prime.
It is not an unprimeable number, because it can be changed into a prime (134300230443329) 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 15 ways as a sum of consecutive naturals, for example, 4580931 + ... + 17017208.
It is an arithmetic number, because the mean of its divisors is an integer number (11257317736380).
Almost surely, 2134300230443321 is an apocalyptic number.
It is an amenable number.
134300230443321 is a deficient number, since it is larger than the sum of its proper divisors (45816853338759).
134300230443321 is a wasteful number, since it uses less digits than its factorization.
134300230443321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21610296.
The product of its (nonzero) digits is 62208, while the sum is 33.
Adding to 134300230443321 its reverse (123344032003431), we get a palindrome (257644262446752).
The spelling of 134300230443321 in words is "one hundred thirty-four trillion, three hundred billion, two hundred thirty million, four hundred forty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •