Base | Representation |
---|---|
bin | 101111000010011011… |
… | …0011011110101110100 |
3 | 100122201202222200002012 |
4 | 1132010312123311310 |
5 | 3123333324011012 |
6 | 114223233303352 |
7 | 10204125161234 |
oct | 1360466336564 |
9 | 318652880065 |
10 | 101013110132 |
11 | 399262a3800 |
12 | 176b1104b58 |
13 | 96aa689cac |
14 | 4c63821cc4 |
15 | 296315a622 |
hex | 1784d9bd74 |
101013110132 has 36 divisors (see below), whose sum is σ = 194331231108. Its totient is φ = 45908649600.
The previous prime is 101013110111. The next prime is 101013110147. The reversal of 101013110132 is 231011310101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 58809160036 + 42203950096 = 242506^2 + 205436^2 .
It is a super-2 number, since 2×1010131101322 (a number of 23 digits) contains 22 as substring.
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, 6206918 + ... + 6223170.
It is an arithmetic number, because the mean of its divisors is an integer number (5398089753).
Almost surely, 2101013110132 is an apocalyptic number.
It is an amenable number.
101013110132 is a deficient number, since it is larger than the sum of its proper divisors (93318120976).
101013110132 is a wasteful number, since it uses less digits than its factorization.
101013110132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29120 (or 29107 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 101013110132 its reverse (231011310101), we get a palindrome (332024420233).
The spelling of 101013110132 in words is "one hundred one billion, thirteen million, one hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •