Base | Representation |
---|---|
bin | 110000111111101000… |
… | …1010100100010100001 |
3 | 101001120120120110112010 |
4 | 1201333101110202201 |
5 | 3210434400241423 |
6 | 120200155023133 |
7 | 10413212112645 |
oct | 1417721244241 |
9 | 331516513463 |
10 | 105214462113 |
11 | 40691903722 |
12 | 1848413aaa9 |
13 | 9bc9c1a197 |
14 | 51417cac25 |
15 | 2b0be05693 |
hex | 187f4548a1 |
105214462113 has 16 divisors (see below), whose sum is σ = 149955716736. Its totient is φ = 65456856960.
The previous prime is 105214462109. The next prime is 105214462207. The reversal of 105214462113 is 311264412501.
It is not a de Polignac number, because 105214462113 - 22 = 105214462109 is a prime.
It is a super-2 number, since 2×1052144621132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105214062113) 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 15 ways as a sum of consecutive naturals, for example, 18592870 + ... + 18598527.
It is an arithmetic number, because the mean of its divisors is an integer number (9372232296).
Almost surely, 2105214462113 is an apocalyptic number.
It is an amenable number.
105214462113 is a deficient number, since it is larger than the sum of its proper divisors (44741254623).
105214462113 is a wasteful number, since it uses less digits than its factorization.
105214462113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37191464.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 105214462113 its reverse (311264412501), we get a palindrome (416478874614).
The spelling of 105214462113 in words is "one hundred five billion, two hundred fourteen million, four hundred sixty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •