Base | Representation |
---|---|
bin | 111110111010001… |
… | …011101101100010 |
3 | 2201112222220002210 |
4 | 332322023231202 |
5 | 4130143032324 |
6 | 252421422550 |
7 | 35104042500 |
oct | 7672135542 |
9 | 2645886083 |
10 | 1055439714 |
11 | 4a184a52a |
12 | 25556aa56 |
13 | 13a87b554 |
14 | a025d670 |
15 | 629d2d29 |
hex | 3ee8bb62 |
1055439714 has 48 divisors (see below), whose sum is σ = 2468112768. Its totient is φ = 300007008.
The previous prime is 1055439701. The next prime is 1055439769. The reversal of 1055439714 is 4179345501.
It is a super-2 number, since 2×10554397142 = 2227905979776803592, which contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48807 + ... + 67029.
It is an arithmetic number, because the mean of its divisors is an integer number (51419016).
Almost surely, 21055439714 is an apocalyptic number.
1055439714 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1055439714, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1234056384).
1055439714 is an abundant number, since it is smaller than the sum of its proper divisors (1412673054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055439714 is a wasteful number, since it uses less digits than its factorization.
1055439714 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18439 (or 18432 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 39.
The square root of 1055439714 is about 32487.5316698576. The cubic root of 1055439714 is about 1018.1485425441.
The spelling of 1055439714 in words is "one billion, fifty-five million, four hundred thirty-nine thousand, seven hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •