Base | Representation |
---|---|
bin | 1111011110011101000… |
… | …01111110100010010000 |
3 | 1212211112021220010201120 |
4 | 13233032201332202100 |
5 | 32203003433201200 |
6 | 1044140350002240 |
7 | 53263106226363 |
oct | 7571641764220 |
9 | 1784467803646 |
10 | 531745990800 |
11 | 19556a827232 |
12 | 870807a6380 |
13 | 3b1b3172a0b |
14 | 1ba454c60da |
15 | dc72b979a0 |
hex | 7bce87e890 |
531745990800 has 60 divisors (see below), whose sum is σ = 1703359661040. Its totient is φ = 141798930560.
The previous prime is 531745990799. The next prime is 531745990801. The reversal of 531745990800 is 8099547135.
It is an interprime number because it is at equal distance from previous prime (531745990799) and next prime (531745990801).
It is a tau number, because it is divible by the number of its divisors (60).
It is not an unprimeable number, because it can be changed into a prime (531745990801) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 221559630 + ... + 221562029.
It is an arithmetic number, because the mean of its divisors is an integer number (28389327684).
Almost surely, 2531745990800 is an apocalyptic number.
531745990800 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
531745990800 is an abundant number, since it is smaller than the sum of its proper divisors (1171613670240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
531745990800 is a wasteful number, since it uses less digits than its factorization.
531745990800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443121680 (or 443121669 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 531745990800 in words is "five hundred thirty-one billion, seven hundred forty-five million, nine hundred ninety thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.225 sec. • engine limits •