Base | Representation |
---|---|
bin | 101111010011001001… |
… | …0001000110100000000 |
3 | 100201011212102212020210 |
4 | 1132212102020310000 |
5 | 3131010422122402 |
6 | 114355031434120 |
7 | 10224045633060 |
oct | 1364622106400 |
9 | 321155385223 |
10 | 101574020352 |
11 | 3a093982972 |
12 | 17828b25940 |
13 | 976994a42c |
14 | 4cb81113a0 |
15 | 299750606c |
hex | 17a6488d00 |
101574020352 has 72 divisors (see below), whose sum is σ = 308954328256. Its totient is φ = 29021147136.
The previous prime is 101574020351. The next prime is 101574020357. The reversal of 101574020352 is 253020475101.
101574020352 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1015740203522 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101574020351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9441613 + ... + 9452364.
Almost surely, 2101574020352 is an apocalyptic number.
101574020352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101574020352 is an abundant number, since it is smaller than the sum of its proper divisors (207380307904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101574020352 is an equidigital number, since it uses as much as digits as its factorization.
101574020352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18894003 (or 18893989 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 30.
Adding to 101574020352 its reverse (253020475101), we get a palindrome (354594495453).
The spelling of 101574020352 in words is "one hundred one billion, five hundred seventy-four million, twenty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •