Base | Representation |
---|---|
bin | 1001100110000110010110… |
… | …1111001000011111001011 |
3 | 1101100120202211222210121212 |
4 | 2121201211233020133023 |
5 | 2340323200003031243 |
6 | 34234400450323335 |
7 | 2136136315620365 |
oct | 231414557103713 |
9 | 41316684883555 |
10 | 10550146533323 |
11 | 33a8323749191 |
12 | 122483288954b |
13 | 5b6b4a500007 |
14 | 2868b6307d35 |
15 | 134678213318 |
hex | 99865bc87cb |
10550146533323 has 8 divisors (see below), whose sum is σ = 10943382326448. Its totient is φ = 10163632719744.
The previous prime is 10550146533293. The next prime is 10550146533349. The reversal of 10550146533323 is 32333564105501.
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 10550146533323 - 212 = 10550146529227 is a prime.
It is a super-2 number, since 2×105501465333232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10550146536323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1680491690 + ... + 1680497967.
It is an arithmetic number, because the mean of its divisors is an integer number (1367922790806).
Almost surely, 210550146533323 is an apocalyptic number.
10550146533323 is a deficient number, since it is larger than the sum of its proper divisors (393235793125).
10550146533323 is an equidigital number, since it uses as much as digits as its factorization.
10550146533323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3360989773.
The product of its (nonzero) digits is 486000, while the sum is 41.
The spelling of 10550146533323 in words is "ten trillion, five hundred fifty billion, one hundred forty-six million, five hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •