Base | Representation |
---|---|
bin | 1111011111010111111… |
… | …10100101100110010100 |
3 | 1212212210201111221020102 |
4 | 13233223332211212110 |
5 | 32210011421430400 |
6 | 1044301354553232 |
7 | 53311255416242 |
oct | 7575376454624 |
9 | 1785721457212 |
10 | 532240030100 |
11 | 1957a3692279 |
12 | 8719a138818 |
13 | 3b26161b96c |
14 | 1ba90d69792 |
15 | dca12349d5 |
hex | 7bebfa5994 |
532240030100 has 36 divisors (see below), whose sum is σ = 1157704331868. Its totient is φ = 212390304000.
The previous prime is 532240030067. The next prime is 532240030129. The reversal of 532240030100 is 1030042235.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 276556084996 + 255683945104 = 525886^2 + 505652^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6279041 + ... + 6363240.
It is an arithmetic number, because the mean of its divisors is an integer number (32158453663).
Almost surely, 2532240030100 is an apocalyptic number.
532240030100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
532240030100 is an abundant number, since it is smaller than the sum of its proper divisors (625464301768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
532240030100 is a wasteful number, since it uses less digits than its factorization.
532240030100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12642716 (or 12642709 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
Adding to 532240030100 its reverse (1030042235), we get a palindrome (533270072335).
The spelling of 532240030100 in words is "five hundred thirty-two billion, two hundred forty million, thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •