Base | Representation |
---|---|
bin | 1001111010011000… |
… | …11010011111010100 |
3 | 111201212120220022101 |
4 | 10331030122133110 |
5 | 41344314203300 |
6 | 2240021011444 |
7 | 245606060140 |
oct | 47514323724 |
9 | 14655526271 |
10 | 5321631700 |
11 | 2290a16730 |
12 | 1046253b84 |
13 | 66a6916c8 |
14 | 386aa6220 |
15 | 2122d9b6a |
hex | 13d31a7d4 |
5321631700 has 72 divisors (see below), whose sum is σ = 14397453504. Its totient is φ = 1658688000.
The previous prime is 5321631691. The next prime is 5321631743. The reversal of 5321631700 is 71361235.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent 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, 337861 + ... + 353260.
It is an arithmetic number, because the mean of its divisors is an integer number (199964632).
Almost surely, 25321631700 is an apocalyptic number.
5321631700 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5321631700 is an abundant number, since it is smaller than the sum of its proper divisors (9075821804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5321631700 is a wasteful number, since it uses less digits than its factorization.
5321631700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 691153 (or 691146 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 28.
The square root of 5321631700 is about 72949.5147345066. The cubic root of 5321631700 is about 1745.8822040319.
Adding to 5321631700 its reverse (71361235), we get a palindrome (5392992935).
It can be divided in two parts, 53 and 21631700, that added together give a triangular number (21631753 = T6577).
The spelling of 5321631700 in words is "five billion, three hundred twenty-one million, six hundred thirty-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •