Base | Representation |
---|---|
bin | 11101110100001001001… |
… | …11010010000100101111 |
3 | 10121221020002100000022011 |
4 | 32322010213102010233 |
5 | 113241011314402412 |
6 | 2102340524102051 |
7 | 134004154506202 |
oct | 16720447220457 |
9 | 3557202300264 |
10 | 1024427106607 |
11 | 365503438703 |
12 | 14665a694927 |
13 | 757abc07488 |
14 | 378226a1939 |
15 | 1b9aaec27a7 |
hex | ee849d212f |
1024427106607 has 8 divisors (see below), whose sum is σ = 1058761199232. Its totient is φ = 990173517600.
The previous prime is 1024427106553. The next prime is 1024427106611. The reversal of 1024427106607 is 7066017244201.
1024427106607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1024427106607 - 235 = 990067368239 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1024427106607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1024427106007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20100028 + ... + 20150929.
It is an arithmetic number, because the mean of its divisors is an integer number (132345149904).
Almost surely, 21024427106607 is an apocalyptic number.
1024427106607 is a deficient number, since it is larger than the sum of its proper divisors (34334092625).
1024427106607 is an equidigital number, since it uses as much as digits as its factorization.
1024427106607 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40251809.
The product of its (nonzero) digits is 112896, while the sum is 40.
The spelling of 1024427106607 in words is "one trillion, twenty-four billion, four hundred twenty-seven million, one hundred six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •