Base | Representation |
---|---|
bin | 101000100110001… |
… | …101111111110111 |
3 | 1202110121211202202 |
4 | 220212031333313 |
5 | 2343330414242 |
6 | 151330255115 |
7 | 22610213666 |
oct | 5046157767 |
9 | 1673554682 |
10 | 681107447 |
11 | 31a516119 |
12 | 17012749b |
13 | ab156077 |
14 | 6665addd |
15 | 3ebde932 |
hex | 2898dff7 |
681107447 has 4 divisors (see below), whose sum is σ = 690437760. Its totient is φ = 671777136.
The previous prime is 681107411. The next prime is 681107467. The reversal of 681107447 is 744701186.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 681107447 - 28 = 681107191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 681107447.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (681107467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4665047 + ... + 4665192.
It is an arithmetic number, because the mean of its divisors is an integer number (172609440).
Almost surely, 2681107447 is an apocalyptic number.
681107447 is a deficient number, since it is larger than the sum of its proper divisors (9330313).
681107447 is an equidigital number, since it uses as much as digits as its factorization.
681107447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9330312.
The product of its (nonzero) digits is 37632, while the sum is 38.
The square root of 681107447 is about 26098.0353091952. The cubic root of 681107447 is about 879.8430535360.
It can be divided in two parts, 68110 and 7447, that added together give a palindrome (75557).
The spelling of 681107447 in words is "six hundred eighty-one million, one hundred seven thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •