Base | Representation |
---|---|
bin | 10000000101110010… |
… | …01001001111101111 |
3 | 211022000210200212010 |
4 | 20002321021033233 |
5 | 120142422002403 |
6 | 3545104212303 |
7 | 424032530055 |
oct | 100271111757 |
9 | 24260720763 |
10 | 8638469103 |
11 | 3733210770 |
12 | 181100a093 |
13 | a788ba7a4 |
14 | 5bd3c61d5 |
15 | 3585b6603 |
hex | 202e493ef |
8638469103 has 32 divisors (see below), whose sum is σ = 12809809152. Its totient is φ = 5134380800.
The previous prime is 8638469101. The next prime is 8638469107. The reversal of 8638469103 is 3019648368.
8638469103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 8638469103 - 21 = 8638469101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8638469101) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 363733 + ... + 386753.
It is an arithmetic number, because the mean of its divisors is an integer number (400306536).
Almost surely, 28638469103 is an apocalyptic number.
8638469103 is a gapful number since it is divisible by the number (83) formed by its first and last digit.
8638469103 is a deficient number, since it is larger than the sum of its proper divisors (4171340049).
8638469103 is a wasteful number, since it uses less digits than its factorization.
8638469103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23255.
The product of its (nonzero) digits is 746496, while the sum is 48.
The square root of 8638469103 is about 92943.3650294630. The cubic root of 8638469103 is about 2051.8499345456.
The spelling of 8638469103 in words is "eight billion, six hundred thirty-eight million, four hundred sixty-nine thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •