Base | Representation |
---|---|
bin | 10111111000011101110000… |
… | …111110000011101101100001 |
3 | 111202220021112002020222212002 |
4 | 113320131300332003231201 |
5 | 102231344314024240001 |
6 | 1011220320553013345 |
7 | 31060360105425605 |
oct | 2770356076035541 |
9 | 452807462228762 |
10 | 105035320540001 |
11 | 305162581a8165 |
12 | b9446703b4255 |
13 | 467ba32970b07 |
14 | 1bd1a454a3505 |
15 | c22322c8b46b |
hex | 5f8770f83b61 |
105035320540001 has 4 divisors (see below), whose sum is σ = 106514691251904. Its totient is φ = 103555949828100.
The previous prime is 105035320539979. The next prime is 105035320540009. The reversal of 105035320540001 is 100045023530501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105035320540001 - 230 = 105034246798177 is a prime.
It is a super-2 number, since 2×1050353205400012 (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 (105035320540009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 739685355845 + ... + 739685355986.
It is an arithmetic number, because the mean of its divisors is an integer number (26628672812976).
Almost surely, 2105035320540001 is an apocalyptic number.
It is an amenable number.
105035320540001 is a deficient number, since it is larger than the sum of its proper divisors (1479370711903).
105035320540001 is an equidigital number, since it uses as much as digits as its factorization.
105035320540001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1479370711902.
The product of its (nonzero) digits is 9000, while the sum is 29.
The spelling of 105035320540001 in words is "one hundred five trillion, thirty-five billion, three hundred twenty million, five hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •