Base | Representation |
---|---|
bin | 1010000000011111… |
… | …11010111100101111 |
3 | 111212110000201111212 |
4 | 11000033322330233 |
5 | 42000424221420 |
6 | 2245051305035 |
7 | 250100515103 |
oct | 50017727457 |
9 | 14773021455 |
10 | 5372882735 |
11 | 2307941360 |
12 | 105b44b17b |
13 | 67819736c |
14 | 38d807903 |
15 | 216a603c5 |
hex | 1403faf2f |
5372882735 has 32 divisors (see below), whose sum is σ = 7093929024. Its totient is φ = 3874176000.
The previous prime is 5372882729. The next prime is 5372882737.
It is a happy number.
5372882735 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5372882735 - 28 = 5372882479 is a prime.
It is a super-2 number, since 2×53728827352 = 57735737768122160450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5372882737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4548845 + ... + 4550025.
It is an arithmetic number, because the mean of its divisors is an integer number (221685282).
Almost surely, 25372882735 is an apocalyptic number.
5372882735 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5372882735 is a deficient number, since it is larger than the sum of its proper divisors (1721046289).
5372882735 is a wasteful number, since it uses less digits than its factorization.
5372882735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1835.
The product of its digits is 2822400, while the sum is 50.
The square root of 5372882735 is about 73299.9504433666. The cubic root of 5372882735 is about 1751.4689962006.
The spelling of 5372882735 in words is "five billion, three hundred seventy-two million, eight hundred eighty-two thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •