Base | Representation |
---|---|
bin | 110000111001101010… |
… | …1000010110010110010 |
3 | 101001001121120121000201 |
4 | 1201303111002302302 |
5 | 3210032103031120 |
6 | 120124240505414 |
7 | 10405230135055 |
oct | 1416325026262 |
9 | 331047517021 |
10 | 105014111410 |
11 | 4059980122a |
12 | 1842901b26a |
13 | 9b9756c380 |
14 | 5122d56a9c |
15 | 2ae952c40a |
hex | 1873542cb2 |
105014111410 has 32 divisors (see below), whose sum is σ = 206902976112. Its totient is φ = 38138791680.
The previous prime is 105014111393. The next prime is 105014111467. The reversal of 105014111410 is 14111410501.
It can be written as a sum of positive squares in 8 ways, for example, as 12837889 + 105001273521 = 3583^2 + 324039^2 .
It is a super-2 number, since 2×1050141114102 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 6613389 + ... + 6629248.
Almost surely, 2105014111410 is an apocalyptic number.
105014111410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105014111410 is a deficient number, since it is larger than the sum of its proper divisors (101888864702).
105014111410 is a wasteful number, since it uses less digits than its factorization.
105014111410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13242718.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 105014111410 its reverse (14111410501), we get a palindrome (119125521911).
The spelling of 105014111410 in words is "one hundred five billion, fourteen million, one hundred eleven thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •