Base | Representation |
---|---|
bin | 110000111010110101… |
… | …1011000010101000111 |
3 | 101001011100201211010102 |
4 | 1201311223120111013 |
5 | 3210122200134343 |
6 | 120132205314315 |
7 | 10406216124350 |
oct | 1416553302507 |
9 | 331140654112 |
10 | 105053521223 |
11 | 40609a79422 |
12 | 1843a26599b |
13 | 9ba278a3a1 |
14 | 5128294d27 |
15 | 2aecc143b8 |
hex | 1875ad8547 |
105053521223 has 24 divisors (see below), whose sum is σ = 125566445088. Its totient is φ = 86090856192.
The previous prime is 105053521171. The next prime is 105053521271. The reversal of 105053521223 is 322125350501.
It is not a de Polignac number, because 105053521223 - 26 = 105053521159 is a prime.
It is a super-2 number, since 2×1050535212232 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105053521423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10041011 + ... + 10051467.
It is an arithmetic number, because the mean of its divisors is an integer number (5231935212).
Almost surely, 2105053521223 is an apocalyptic number.
105053521223 is a deficient number, since it is larger than the sum of its proper divisors (20512923865).
105053521223 is a wasteful number, since it uses less digits than its factorization.
105053521223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13223 (or 13200 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 105053521223 its reverse (322125350501), we get a palindrome (427178871724).
The spelling of 105053521223 in words is "one hundred five billion, fifty-three million, five hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •