Base | Representation |
---|---|
bin | 10111000010011011100100… |
… | …111110000111111000111100 |
3 | 111021202022002202100120100010 |
4 | 113002123210332013320330 |
5 | 101240030200210100012 |
6 | 555254423410503220 |
7 | 30225165405555660 |
oct | 2702334476077074 |
9 | 437668082316303 |
10 | 101322120003132 |
11 | 2a314519309096 |
12 | b444aa4b94b10 |
13 | 446c833bba822 |
14 | 1b040340588a0 |
15 | baa94a629c3c |
hex | 5c26e4f87e3c |
101322120003132 has 96 divisors (see below), whose sum is σ = 280684687790080. Its totient is φ = 27836890997760.
The previous prime is 101322120003107. The next prime is 101322120003179. The reversal of 101322120003132 is 231300021223101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 101322120003099 and 101322120003108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 123508957 + ... + 124326612.
Almost surely, 2101322120003132 is an apocalyptic number.
101322120003132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101322120003132 is an abundant number, since it is smaller than the sum of its proper divisors (179362567786948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101322120003132 is a wasteful number, since it uses less digits than its factorization.
101322120003132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247835771 (or 247835769 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101322120003132 its reverse (231300021223101), we get a palindrome (332622141226233).
The spelling of 101322120003132 in words is "one hundred one trillion, three hundred twenty-two billion, one hundred twenty million, three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •