Base | Representation |
---|---|
bin | 1100111000010… |
… | …01110110100001 |
3 | 21112022012001211 |
4 | 12130021312201 |
5 | 210124344211 |
6 | 14415430121 |
7 | 2451233104 |
oct | 634116641 |
9 | 245265054 |
10 | 108043681 |
11 | 55a958a9 |
12 | 30225341 |
13 | 194cba95 |
14 | 104c673b |
15 | 9742e21 |
hex | 6709da1 |
108043681 has 2 divisors, whose sum is σ = 108043682. Its totient is φ = 108043680.
The previous prime is 108043679. The next prime is 108043693. The reversal of 108043681 is 186340801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107827456 + 216225 = 10384^2 + 465^2 .
It is a cyclic number.
It is not a de Polignac number, because 108043681 - 21 = 108043679 is a prime.
It is a super-2 number, since 2×1080436812 = 23346874008059522, which contains 22 as substring.
Together with 108043679, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (108043081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54021840 + 54021841.
It is an arithmetic number, because the mean of its divisors is an integer number (54021841).
Almost surely, 2108043681 is an apocalyptic number.
It is an amenable number.
108043681 is a deficient number, since it is larger than the sum of its proper divisors (1).
108043681 is an equidigital number, since it uses as much as digits as its factorization.
108043681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 31.
The square root of 108043681 is about 10394.4062360483. The cubic root of 108043681 is about 476.2845099602.
It can be divided in two parts, 10804368 and 1, that added together give a square (10804369 = 32872).
The spelling of 108043681 in words is "one hundred eight million, forty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •