Base | Representation |
---|---|
bin | 10111111000011011111011… |
… | …001001001010110001001001 |
3 | 111202220002102022120012102022 |
4 | 113320123323021022301021 |
5 | 102231331241444203001 |
6 | 1011215352455214225 |
7 | 31060260113054324 |
oct | 2770337311126111 |
9 | 452802368505368 |
10 | 105033343741001 |
11 | 30515433367885 |
12 | b9441ba377375 |
13 | 467b7a925ab70 |
14 | 1bd18d8b277bb |
15 | c2225945d11b |
hex | 5f86fb24ac49 |
105033343741001 has 16 divisors (see below), whose sum is σ = 114209484970896. Its totient is φ = 96015305680896.
The previous prime is 105033343740943. The next prime is 105033343741003. The reversal of 105033343741001 is 100147343330501.
It can be written as a sum of positive squares in 8 ways, for example, as 27552840846400 + 77480502894601 = 5249080^2 + 8802301^2 .
It is a cyclic number.
It is not a de Polignac number, because 105033343741001 - 218 = 105033343478857 is a prime.
It is a super-2 number, since 2×1050333437410012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105033343741003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28213910 + ... + 31718943.
It is an arithmetic number, because the mean of its divisors is an integer number (7138092810681).
Almost surely, 2105033343741001 is an apocalyptic number.
It is an amenable number.
105033343741001 is a deficient number, since it is larger than the sum of its proper divisors (9176141229895).
105033343741001 is a wasteful number, since it uses less digits than its factorization.
105033343741001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59934172.
The product of its (nonzero) digits is 45360, while the sum is 35.
The spelling of 105033343741001 in words is "one hundred five trillion, thirty-three billion, three hundred forty-three million, seven hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.029 sec. • engine limits •