Base | Representation |
---|---|
bin | 110001000101010010… |
… | …1010100010010000001 |
3 | 101002001210200212002211 |
4 | 1202022211110102001 |
5 | 3211331442101223 |
6 | 120231054542121 |
7 | 10421005241032 |
oct | 1421245242201 |
9 | 332053625084 |
10 | 105404253313 |
11 | 40779a53657 |
12 | 18517807941 |
13 | 9c2a33b878 |
14 | 515cab2a89 |
15 | 2b1d8e4d0d |
hex | 188a954481 |
105404253313 has 8 divisors (see below), whose sum is σ = 106943375648. Its totient is φ = 103867704864.
The previous prime is 105404253277. The next prime is 105404253323. The reversal of 105404253313 is 313352404501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105404253313 is a prime.
It is a super-2 number, since 2×1054042533132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105404253323) 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 7 ways as a sum of consecutive naturals, for example, 560895 + ... + 724852.
It is an arithmetic number, because the mean of its divisors is an integer number (13367921956).
Almost surely, 2105404253313 is an apocalyptic number.
It is an amenable number.
105404253313 is a deficient number, since it is larger than the sum of its proper divisors (1539122335).
105404253313 is a wasteful number, since it uses less digits than its factorization.
105404253313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286943.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 105404253313 its reverse (313352404501), we get a palindrome (418756657814).
The spelling of 105404253313 in words is "one hundred five billion, four hundred four million, two hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •