Base | Representation |
---|---|
bin | 10110111110000011010111… |
… | …001101011000001100100111 |
3 | 111020200112111000012101212100 |
4 | 112332003113031120030213 |
5 | 101220113000300112333 |
6 | 554504303450223143 |
7 | 30164354351664312 |
oct | 2676032715301447 |
9 | 436615430171770 |
10 | 101021241410343 |
11 | 2a208960181051 |
12 | b3b6715424ab3 |
13 | 444a35404c337 |
14 | 1ad365036d979 |
15 | ba2bdac6c213 |
hex | 5be0d7358327 |
101021241410343 has 12 divisors (see below), whose sum is σ = 145921455471168. Its totient is φ = 67346624483520.
The previous prime is 101021241410329. The next prime is 101021241410351. The reversal of 101021241410343 is 343014142120101.
It is a happy number.
101021241410343 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 2 + 1 + 241 + 410 + 3 + 4 + 3 = 666.
It is not a de Polignac number, because 101021241410343 - 214 = 101021241393959 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101021241410443) 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, 71746530 + ... + 73141007.
It is an arithmetic number, because the mean of its divisors is an integer number (12160121289264).
Almost surely, 2101021241410343 is an apocalyptic number.
101021241410343 is a deficient number, since it is larger than the sum of its proper divisors (44900214060825).
101021241410343 is a wasteful number, since it uses less digits than its factorization.
101021241410343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144965014 (or 144965011 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 101021241410343 its reverse (343014142120101), we get a palindrome (444035383530444).
The spelling of 101021241410343 in words is "one hundred one trillion, twenty-one billion, two hundred forty-one million, four hundred ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •