Base | Representation |
---|---|
bin | 111110111011000… |
… | …001010110100111 |
3 | 2201120102001111110 |
4 | 332323001112213 |
5 | 4130222100211 |
6 | 252430240103 |
7 | 35105646201 |
oct | 7673012647 |
9 | 2646361443 |
10 | 1055659431 |
11 | 4a198a612 |
12 | 255656033 |
13 | 13a927568 |
14 | a02b9771 |
15 | 62a27ea6 |
hex | 3eec15a7 |
1055659431 has 8 divisors (see below), whose sum is σ = 1441876464. Its totient is φ = 686607680.
The previous prime is 1055659403. The next prime is 1055659457. The reversal of 1055659431 is 1349565501.
It is a happy number.
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 1055659431 - 217 = 1055528359 is a prime.
It is a super-3 number, since 3×10556594313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1055659431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055659471) 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, 4291176 + ... + 4291421.
It is an arithmetic number, because the mean of its divisors is an integer number (180234558).
Almost surely, 21055659431 is an apocalyptic number.
1055659431 is a deficient number, since it is larger than the sum of its proper divisors (386217033).
1055659431 is an equidigital number, since it uses as much as digits as its factorization.
1055659431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8582641.
The product of its (nonzero) digits is 81000, while the sum is 39.
The square root of 1055659431 is about 32490.9130527291. The cubic root of 1055659431 is about 1018.2191889357.
The spelling of 1055659431 in words is "one billion, fifty-five million, six hundred fifty-nine thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •