Base | Representation |
---|---|
bin | 10011001101110000… |
… | …11100001011011001 |
3 | 222121221101102000012 |
4 | 21212320130023121 |
5 | 132111344143410 |
6 | 4423351451305 |
7 | 513432414356 |
oct | 114670341331 |
9 | 28557342005 |
10 | 10316006105 |
11 | 4414131089 |
12 | 1bba986b35 |
13 | c85300832 |
14 | 6dc10162d |
15 | 4059ce605 |
hex | 266e1c2d9 |
10316006105 has 8 divisors (see below), whose sum is σ = 12681139464. Its totient is φ = 8051516800.
The previous prime is 10316006083. The next prime is 10316006111. The reversal of 10316006105 is 50160061301.
It is a happy number.
10316006105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 310605376 + 10005400729 = 17624^2 + 100027^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10316006105 - 28 = 10316005849 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25160786 + ... + 25161195.
It is an arithmetic number, because the mean of its divisors is an integer number (1585142433).
Almost surely, 210316006105 is an apocalyptic number.
It is an amenable number.
10316006105 is a deficient number, since it is larger than the sum of its proper divisors (2365133359).
10316006105 is an equidigital number, since it uses as much as digits as its factorization.
10316006105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50322027.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 10316006105 its reverse (50160061301), we get a palindrome (60476067406).
The spelling of 10316006105 in words is "ten billion, three hundred sixteen million, six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •