Base | Representation |
---|---|
bin | 110001001001010101… |
… | …1010000111100110111 |
3 | 101002102021012001001202 |
4 | 1202102223100330313 |
5 | 3212121221432023 |
6 | 120252345043115 |
7 | 10424244312143 |
oct | 1422253207467 |
9 | 332367161052 |
10 | 105540030263 |
11 | 40839660908 |
12 | 1855518649b |
13 | 9c4c4ca965 |
14 | 5172b38223 |
15 | 2b2a7b5128 |
hex | 1892ad0f37 |
105540030263 has 8 divisors (see below), whose sum is σ = 105758632848. Its totient is φ = 105321492864.
The previous prime is 105540030259. The next prime is 105540030283. The reversal of 105540030263 is 362030045501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105540030263 - 22 = 105540030259 is a prime.
It is a super-2 number, since 2×1055400302632 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105540030203) 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 7 ways as a sum of consecutive naturals, for example, 4484495 + ... + 4507967.
It is an arithmetic number, because the mean of its divisors is an integer number (13219829106).
Almost surely, 2105540030263 is an apocalyptic number.
105540030263 is a deficient number, since it is larger than the sum of its proper divisors (218602585).
105540030263 is an equidigital number, since it uses as much as digits as its factorization.
105540030263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32593.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 105540030263 its reverse (362030045501), we get a palindrome (467570075764).
The spelling of 105540030263 in words is "one hundred five billion, five hundred forty million, thirty thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •