Search a number
-
+
1076814000 = 24345317223
BaseRepresentation
bin100000000101110…
…1110000010110000
32210001012211010000
41000023232002300
54201131022000
6254503510000
735453524263
oct10013560260
92701184100
101076814000
11502919329
12260758300
13142123362
14a3024cda
1564806000
hex402ee0b0

1076814000 has 600 divisors, whose sum is σ = 4311429408. Its totient is φ = 258508800.

The previous prime is 1076813989. The next prime is 1076814031. The reversal of 1076814000 is 4186701.

It is a happy number.

It is a tau number, because it is divible by the number of its divisors (600).

It is a Harshad number since it is a multiple of its sum of digits (27).

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 46817989 + ... + 46818011.

Almost surely, 21076814000 is an apocalyptic number.

1076814000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1076814000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2155714704).

1076814000 is an abundant number, since it is smaller than the sum of its proper divisors (3234615408).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1076814000 is a wasteful number, since it uses less digits than its factorization.

1076814000 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 92 (or 50 counting only the distinct ones).

The product of its (nonzero) digits is 1344, while the sum is 27.

The square root of 1076814000 is about 32814.8442019766. The cubic root of 1076814000 is about 1024.9756884973.

The spelling of 1076814000 in words is "one billion, seventy-six million, eight hundred fourteen thousand".