Base | Representation |
---|---|
bin | 10111111100100001110111… |
… | …011101001010011000001010 |
3 | 111210212222101201000220001201 |
4 | 113330201313131022120022 |
5 | 102300433301132400211 |
6 | 1011552505500534414 |
7 | 31116505006560016 |
oct | 2774416735123012 |
9 | 453788351026051 |
10 | 105314602231306 |
11 | 30613743460496 |
12 | b98a81325140a |
13 | 469c180345060 |
14 | 1c0137ab7b546 |
15 | c2971b5e20c1 |
hex | 5fc87774a60a |
105314602231306 has 8 divisors (see below), whose sum is σ = 170123588219844. Its totient is φ = 48606739491360.
The previous prime is 105314602231271. The next prime is 105314602231367. The reversal of 105314602231306 is 603132206413501.
105314602231306 is digitally balanced in base 3, 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 2 ways, for example, as 76579738470225 + 28734863761081 = 8750985^2 + 5360491^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1053146022313062 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2025280812115 + ... + 2025280812166.
Almost surely, 2105314602231306 is an apocalyptic number.
105314602231306 is a deficient number, since it is larger than the sum of its proper divisors (64808985988538).
105314602231306 is a wasteful number, since it uses less digits than its factorization.
105314602231306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4050561624296.
The product of its (nonzero) digits is 77760, while the sum is 37.
Adding to 105314602231306 its reverse (603132206413501), we get a palindrome (708446808644807).
The spelling of 105314602231306 in words is "one hundred five trillion, three hundred fourteen billion, six hundred two million, two hundred thirty-one thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •