Base | Representation |
---|---|
bin | 101110111001110010… |
… | …1110010100000011100 |
3 | 100121222121002200002210 |
4 | 1131303211302200130 |
5 | 3122240211040402 |
6 | 114134410520420 |
7 | 10164010624434 |
oct | 1356345624034 |
9 | 317877080083 |
10 | 100723533852 |
11 | 39797899867 |
12 | 17630136110 |
13 | 966269b896 |
14 | 4c371a32c4 |
15 | 2947a0a06c |
hex | 177397281c |
100723533852 has 48 divisors (see below), whose sum is σ = 254633524992. Its totient is φ = 30864664320.
The previous prime is 100723533829. The next prime is 100723533857. The reversal of 100723533852 is 258335327001.
It is a self number, because there is not a number n which added to its sum of digits gives 100723533852.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100723533857) 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 15 ways as a sum of consecutive naturals, for example, 5732424 + ... + 5749967.
It is an arithmetic number, because the mean of its divisors is an integer number (5304865104).
Almost surely, 2100723533852 is an apocalyptic number.
100723533852 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100723533852 is an abundant number, since it is smaller than the sum of its proper divisors (153909991140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100723533852 is a wasteful number, since it uses less digits than its factorization.
100723533852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11482458 (or 11482456 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 100723533852 in words is "one hundred billion, seven hundred twenty-three million, five hundred thirty-three thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •