Base | Representation |
---|---|
bin | 10111111100010110101000… |
… | …111011101001110011100011 |
3 | 111210211211021120202022121021 |
4 | 113330112220323221303203 |
5 | 102300234104113443201 |
6 | 1011543153352110311 |
7 | 31115600201340622 |
oct | 2774265073516343 |
9 | 453754246668537 |
10 | 105302547406051 |
11 | 30609617862896 |
12 | b98840a095397 |
13 | 469acaba25a68 |
14 | 1c00955b6b6b9 |
15 | c29263141ea1 |
hex | 5fc5a8ee9ce3 |
105302547406051 has 4 divisors (see below), whose sum is σ = 105304154187400. Its totient is φ = 105300940624704.
The previous prime is 105302547406039. The next prime is 105302547406087. The reversal of 105302547406051 is 150604745203501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105302547406051 is a prime.
It is a super-2 number, since 2×1053025474060512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105302547405989 and 105302547406007.
It is not an unprimeable number, because it can be changed into a prime (105302547406151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 803292366 + ... + 803423443.
It is an arithmetic number, because the mean of its divisors is an integer number (26326038546850).
Almost surely, 2105302547406051 is an apocalyptic number.
105302547406051 is a deficient number, since it is larger than the sum of its proper divisors (1606781349).
105302547406051 is an equidigital number, since it uses as much as digits as its factorization.
105302547406051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1606781348.
The product of its (nonzero) digits is 504000, while the sum is 43.
The spelling of 105302547406051 in words is "one hundred five trillion, three hundred two billion, five hundred forty-seven million, four hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •