Base | Representation |
---|---|
bin | 10110111101110011101101… |
… | …110001111011000111011011 |
3 | 111020121221010002210111200220 |
4 | 112331303231301323013123 |
5 | 101214324043144020443 |
6 | 554452444350331123 |
7 | 30163221121142406 |
oct | 2675635561730733 |
9 | 436557102714626 |
10 | 101004440220123 |
11 | 2a201819362180 |
12 | b3b34067b9aa3 |
13 | 44488a72b756b |
14 | 1ad28d8c42d3d |
15 | ba2555c66a83 |
hex | 5bdcedc7b1db |
101004440220123 has 32 divisors (see below), whose sum is σ = 150896259286272. Its totient is φ = 59556402864000.
The previous prime is 101004440220113. The next prime is 101004440220143. The reversal of 101004440220123 is 321022044400101.
It is not a de Polignac number, because 101004440220123 - 25 = 101004440220091 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101004440220093 and 101004440220102.
It is not an unprimeable number, because it can be changed into a prime (101004440220113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15699340 + ... + 21177302.
It is an arithmetic number, because the mean of its divisors is an integer number (4715508102696).
Almost surely, 2101004440220123 is an apocalyptic number.
101004440220123 is a deficient number, since it is larger than the sum of its proper divisors (49891819066149).
101004440220123 is a wasteful number, since it uses less digits than its factorization.
101004440220123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5493115.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 101004440220123 its reverse (321022044400101), we get a palindrome (422026484620224).
The spelling of 101004440220123 in words is "one hundred one trillion, four billion, four hundred forty million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •