Base | Representation |
---|---|
bin | 1001001101000101011110… |
… | …0000110010101100110011 |
3 | 1022211111112212002010112111 |
4 | 2103101113200302230303 |
5 | 2311303100224212233 |
6 | 33305130330110151 |
7 | 2063114136345040 |
oct | 223212740625463 |
9 | 38744485063474 |
10 | 10120411163443 |
11 | 3252051299339 |
12 | 11754a127b357 |
13 | 585473592469 |
14 | 26db8ad041c7 |
15 | 1283c6064acd |
hex | 93457832b33 |
10120411163443 has 8 divisors (see below), whose sum is σ = 11878783759712. Its totient is φ = 8440188460416.
The previous prime is 10120411163389. The next prime is 10120411163561. The reversal of 10120411163443 is 34436111402101.
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 10120411163443 - 225 = 10120377609011 is a prime.
It is a super-2 number, since 2×101204111634432 (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 (10120411163243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19537473030 + ... + 19537473547.
It is an arithmetic number, because the mean of its divisors is an integer number (1484847969964).
Almost surely, 210120411163443 is an apocalyptic number.
10120411163443 is a deficient number, since it is larger than the sum of its proper divisors (1758372596269).
10120411163443 is an equidigital number, since it uses as much as digits as its factorization.
10120411163443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39074946621.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 10120411163443 its reverse (34436111402101), we get a palindrome (44556522565544).
The spelling of 10120411163443 in words is "ten trillion, one hundred twenty billion, four hundred eleven million, one hundred sixty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •