Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …1101001101001101001011 |
3 | 1101101001022220010200221001 |
4 | 2121212013231031031023 |
5 | 2340413130410433003 |
6 | 34240523313555431 |
7 | 2136401010522400 |
oct | 231460755151513 |
9 | 41331286120831 |
10 | 10555011421003 |
11 | 33aa39a862315 |
12 | 122576bb75b77 |
13 | 5b744437318a |
14 | 286c184782a7 |
15 | 13486037b61d |
hex | 99987b4d34b |
10555011421003 has 48 divisors (see below), whose sum is σ = 12437172000000. Its totient is φ = 8931009181248.
The previous prime is 10555011420979. The next prime is 10555011421033. The reversal of 10555011421003 is 30012411055501.
It is not a de Polignac number, because 10555011421003 - 217 = 10555011289931 is a prime.
It is a super-2 number, since 2×105550114210032 (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 (10555011421033) 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 47 ways as a sum of consecutive naturals, for example, 841768308 + ... + 841780846.
It is an arithmetic number, because the mean of its divisors is an integer number (259107750000).
Almost surely, 210555011421003 is an apocalyptic number.
10555011421003 is a deficient number, since it is larger than the sum of its proper divisors (1882160578997).
10555011421003 is a wasteful number, since it uses less digits than its factorization.
10555011421003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13424 (or 13417 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 10555011421003 its reverse (30012411055501), we get a palindrome (40567422476504).
The spelling of 10555011421003 in words is "ten trillion, five hundred fifty-five billion, eleven million, four hundred twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •