Base | Representation |
---|---|
bin | 1001010111100101110010… |
… | …1000010101011101110001 |
3 | 1100110202101102200010120211 |
4 | 2111321130220111131301 |
5 | 2322232203211401421 |
6 | 33524054520504121 |
7 | 2112133356243502 |
oct | 225713450253561 |
9 | 40422342603524 |
10 | 10300885653361 |
11 | 3311643453846 |
12 | 11a446991b041 |
13 | 5994a55c9674 |
14 | 2787cbb34ba9 |
15 | 12ce3a2479e1 |
hex | 95e5ca15771 |
10300885653361 has 8 divisors (see below), whose sum is σ = 10316641915584. Its totient is φ = 10285129913520.
The previous prime is 10300885653353. The next prime is 10300885653391. The reversal of 10300885653361 is 16335658800301.
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 10300885653361 - 23 = 10300885653353 is a prime.
It is a super-2 number, since 2×103008856533612 (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 (10300885653391) 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, 61420326 + ... + 61587808.
It is an arithmetic number, because the mean of its divisors is an integer number (1289580239448).
Almost surely, 210300885653361 is an apocalyptic number.
It is an amenable number.
10300885653361 is a deficient number, since it is larger than the sum of its proper divisors (15756262223).
10300885653361 is an equidigital number, since it uses as much as digits as its factorization.
10300885653361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261191.
The product of its (nonzero) digits is 1555200, while the sum is 49.
The spelling of 10300885653361 in words is "ten trillion, three hundred billion, eight hundred eighty-five million, six hundred fifty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •