Base | Representation |
---|---|
bin | 110001001001001010… |
… | …0010001100000001101 |
3 | 101002101211211211111200 |
4 | 1202102110101200031 |
5 | 3212113201100323 |
6 | 120252011540113 |
7 | 10424142140442 |
oct | 1422224214015 |
9 | 332354754450 |
10 | 105534003213 |
11 | 40836214681 |
12 | 1855315a639 |
13 | 9c4b19a562 |
14 | 51720099c9 |
15 | 2b29ec4443 |
hex | 189251180d |
105534003213 has 48 divisors (see below), whose sum is σ = 155769868800. Its totient is φ = 68838739200.
The previous prime is 105534003203. The next prime is 105534003227. The reversal of 105534003213 is 312300435501.
105534003213 is a `hidden beast` number, since 105 + 5 + 340 + 0 + 3 + 213 = 666.
It is not a de Polignac number, because 105534003213 - 28 = 105534002957 is a prime.
It is a super-2 number, since 2×1055340032132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105534003203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 31968663 + ... + 31971963.
It is an arithmetic number, because the mean of its divisors is an integer number (3245205600).
Almost surely, 2105534003213 is an apocalyptic number.
It is an amenable number.
105534003213 is a deficient number, since it is larger than the sum of its proper divisors (50235865587).
105534003213 is a wasteful number, since it uses less digits than its factorization.
105534003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3802 (or 3799 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 105534003213 its reverse (312300435501), we get a palindrome (417834438714).
The spelling of 105534003213 in words is "one hundred five billion, five hundred thirty-four million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •