Search a number
-
+
5032049022 = 2347211213231
BaseRepresentation
bin1001010111110111…
…01111100101111110
3110222200200120120000
410223323233211332
540301201032042
62151154135130
7235461465600
oct45373574576
913880616500
105032049022
112152507a00
12b852814a6
136226a0400
1435a445170
151e6b8774c
hex12beef97e

5032049022 has 540 divisors, whose sum is σ = 16115143968. Its totient is φ = 1167566400.

The previous prime is 5032049021. The next prime is 5032049047. The reversal of 5032049022 is 2209402305.

It is a super-2 number, since 2×50320490222 = 50643034719622312968, which contains 22 as substring.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5032049021) by changing a digit.

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

It is a polite number, since it can be written in 269 ways as a sum of consecutive naturals, for example, 162324147 + ... + 162324177.

Almost surely, 25032049022 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 5032049022 is about 70936.9369369724. The cubic root of 5032049022 is about 1713.6217053191.

The spelling of 5032049022 in words is "five billion, thirty-two million, forty-nine thousand, twenty-two".