Base | Representation |
---|---|
bin | 101111110100100111111001… |
… | …010000110100010011010101 |
3 | 1000120200211010112101222020220 |
4 | 233310213321100310103111 |
5 | 210031423420434000031 |
6 | 2023153413424144553 |
7 | 62205303402556602 |
oct | 5764477120642325 |
9 | 1016624115358226 |
10 | 210324435453141 |
11 | 6101a101737239 |
12 | 1b70a34ba68159 |
13 | 90486808179c9 |
14 | 39d1a852836a9 |
15 | 194b04b9ea596 |
hex | bf49f94344d5 |
210324435453141 has 16 divisors (see below), whose sum is σ = 281095940157120. Its totient is φ = 139884970856960.
The previous prime is 210324435453107. The next prime is 210324435453149. The reversal of 210324435453141 is 141354534423012.
It is a cyclic number.
It is not a de Polignac number, because 210324435453141 - 247 = 69586947097813 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210324435453093 and 210324435453102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210324435453149) 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, 42705660 + ... + 47375333.
It is an arithmetic number, because the mean of its divisors is an integer number (17568496259820).
Almost surely, 2210324435453141 is an apocalyptic number.
It is an amenable number.
210324435453141 is a deficient number, since it is larger than the sum of its proper divisors (70771504703979).
210324435453141 is a wasteful number, since it uses less digits than its factorization.
210324435453141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90082836.
The product of its (nonzero) digits is 691200, while the sum is 42.
Adding to 210324435453141 its reverse (141354534423012), we get a palindrome (351678969876153).
The spelling of 210324435453141 in words is "two hundred ten trillion, three hundred twenty-four billion, four hundred thirty-five million, four hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •