Base | Representation |
---|---|
bin | 10110110010000110100010… |
… | …000111111101010001001101 |
3 | 111010210000202010021002010210 |
4 | 112302012202013331101031 |
5 | 101113134111040341331 |
6 | 553035130002553033 |
7 | 30051132464356110 |
oct | 2662064207752115 |
9 | 433700663232123 |
10 | 100200012043341 |
11 | 29a2164a653751 |
12 | b2a3525368779 |
13 | 43baa88ac0a52 |
14 | 1aa59c674a577 |
15 | b8b673d22446 |
hex | 5b21a21fd44d |
100200012043341 has 32 divisors (see below), whose sum is σ = 158403094528000. Its totient is φ = 55131701898240.
The previous prime is 100200012043309. The next prime is 100200012043393. The reversal of 100200012043341 is 143340210002001.
It is not a de Polignac number, because 100200012043341 - 25 = 100200012043309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200012083341) 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 31 ways as a sum of consecutive naturals, for example, 386596756 + ... + 386855853.
It is an arithmetic number, because the mean of its divisors is an integer number (4950096704000).
Almost surely, 2100200012043341 is an apocalyptic number.
It is an amenable number.
100200012043341 is a deficient number, since it is larger than the sum of its proper divisors (58203082484659).
100200012043341 is a wasteful number, since it uses less digits than its factorization.
100200012043341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 773452849.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 100200012043341 its reverse (143340210002001), we get a palindrome (243540222045342).
The spelling of 100200012043341 in words is "one hundred trillion, two hundred billion, twelve million, forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •