Base | Representation |
---|---|
bin | 101111110001111111000010… |
… | …100111100100000000101011 |
3 | 1000120001111011001021211010200 |
4 | 233301333002213210000223 |
5 | 210020441112242324121 |
6 | 2022534230552043243 |
7 | 62156224443162366 |
oct | 5761770247440053 |
9 | 1016044131254120 |
10 | 210143130042411 |
11 | 60a5a223541715 |
12 | 1b69b191093523 |
13 | 90345485c2797 |
14 | 39c6da5d590dd |
15 | 19464898d3a26 |
hex | bf1fc29e402b |
210143130042411 has 12 divisors (see below), whose sum is σ = 304264516057320. Its totient is φ = 139761063414720.
The previous prime is 210143130042397. The next prime is 210143130042451. The reversal of 210143130042411 is 114240031341012.
It is a happy number.
210143130042411 is a `hidden beast` number, since 2 + 101 + 4 + 3 + 130 + 0 + 424 + 1 + 1 = 666.
It is not a de Polignac number, because 210143130042411 - 27 = 210143130042283 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210143130042451) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27863047150 + ... + 27863054691.
It is an arithmetic number, because the mean of its divisors is an integer number (25355376338110).
Almost surely, 2210143130042411 is an apocalyptic number.
210143130042411 is a deficient number, since it is larger than the sum of its proper divisors (94121386014909).
210143130042411 is a wasteful number, since it uses less digits than its factorization.
210143130042411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55726102266 (or 55726102263 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 210143130042411 its reverse (114240031341012), we get a palindrome (324383161383423).
The spelling of 210143130042411 in words is "two hundred ten trillion, one hundred forty-three billion, one hundred thirty million, forty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •