Search a number
-
+
2097956952 = 23327213149307
BaseRepresentation
bin111110100001100…
…0100100001011000
312102012200020220100
41331003010201120
513244034110302
6544102255400
7102663224400
oct17503044130
95365606810
102097956952
11987273123
124a6727560
13275853c60
1415c8b7800
15c42b1d1c
hex7d0c4858

2097956952 has 288 divisors, whose sum is σ = 7189182000. Its totient is φ = 547803648.

The previous prime is 2097956933. The next prime is 2097956963. The reversal of 2097956952 is 2596597902.

It is a happy number.

2097956952 is a `hidden beast` number, since 2 + 0 + 9 + 79 + 569 + 5 + 2 = 666.

It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 6833583 + ... + 6833889.

Almost surely, 22097956952 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 3061800, while the sum is 54.

The square root of 2097956952 is about 45803.4600439748. The cubic root of 2097956952 is about 1280.1637469550.

The spelling of 2097956952 in words is "two billion, ninety-seven million, nine hundred fifty-six thousand, nine hundred fifty-two".