Base | Representation |
---|---|
bin | 1001100101001111100000… |
… | …1010001110100100111001 |
3 | 1101022011202202112000211110 |
4 | 2121103320022032210321 |
5 | 2340103021322144010 |
6 | 34223523455150533 |
7 | 2135105415655422 |
oct | 231237012164471 |
9 | 41264682460743 |
10 | 10535423240505 |
11 | 33a2058841399 |
12 | 1221a03b15449 |
13 | 5b56420b7927 |
14 | 285cbab52649 |
15 | 1340b585b120 |
hex | 994f828e939 |
10535423240505 has 8 divisors (see below), whose sum is σ = 16856677184832. Its totient is φ = 5618892394928.
The previous prime is 10535423240477. The next prime is 10535423240509. The reversal of 10535423240505 is 50504232453501.
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 10535423240505 - 28 = 10535423240249 is a prime.
It is a super-2 number, since 2×105354232405052 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10535423240509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 351180774669 + ... + 351180774698.
It is an arithmetic number, because the mean of its divisors is an integer number (2107084648104).
Almost surely, 210535423240505 is an apocalyptic number.
10535423240505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10535423240505 is a deficient number, since it is larger than the sum of its proper divisors (6321253944327).
10535423240505 is an equidigital number, since it uses as much as digits as its factorization.
10535423240505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702361549375.
The product of its (nonzero) digits is 360000, while the sum is 39.
The spelling of 10535423240505 in words is "ten trillion, five hundred thirty-five billion, four hundred twenty-three million, two hundred forty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •