Base | Representation |
---|---|
bin | 10110110101001100010110… |
… | …000010010111100110001001 |
3 | 111011112022222111201222011101 |
4 | 112311030112002113212021 |
5 | 101130124103443222443 |
6 | 553320454023101401 |
7 | 30102362062343536 |
oct | 2665142602274611 |
9 | 434468874658141 |
10 | 100412410132873 |
11 | 29aa3733857033 |
12 | b318720ba1861 |
13 | 4404b07897577 |
14 | 1ab1db5273d8d |
15 | b91e5594e84d |
hex | 5b5316097989 |
100412410132873 has 2 divisors, whose sum is σ = 100412410132874. Its totient is φ = 100412410132872.
The previous prime is 100412410132871. The next prime is 100412410133099. The reversal of 100412410132873 is 378231014214001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77835923966089 + 22576486166784 = 8822467^2 + 4751472^2 .
It is a cyclic number.
It is not a de Polignac number, because 100412410132873 - 21 = 100412410132871 is a prime.
Together with 100412410132871, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100412410132871) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50206205066436 + 50206205066437.
It is an arithmetic number, because the mean of its divisors is an integer number (50206205066437).
Almost surely, 2100412410132873 is an apocalyptic number.
It is an amenable number.
100412410132873 is a deficient number, since it is larger than the sum of its proper divisors (1).
100412410132873 is an equidigital number, since it uses as much as digits as its factorization.
100412410132873 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32256, while the sum is 37.
Adding to 100412410132873 its reverse (378231014214001), we get a palindrome (478643424346874).
The spelling of 100412410132873 in words is "one hundred trillion, four hundred twelve billion, four hundred ten million, one hundred thirty-two thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •