Base | Representation |
---|---|
bin | 10110111101101111101110… |
… | …000101101011101100000000 |
3 | 111020121112001010210201101021 |
4 | 112331233232011223230000 |
5 | 101214241302002320022 |
6 | 554450454545315224 |
7 | 30163006611432112 |
oct | 2675575605535400 |
9 | 436545033721337 |
10 | 101000150432512 |
11 | 2a1aaa1793a261 |
12 | b3b260a035b14 |
13 | 44483726324b6 |
14 | 1ad260d2173b2 |
15 | ba23a434d7c7 |
hex | 5bdbee16bb00 |
101000150432512 has 144 divisors (see below), whose sum is σ = 208192639906944. Its totient is φ = 48870388736000.
The previous prime is 101000150432507. The next prime is 101000150432513. The reversal of 101000150432512 is 215234051000101.
It is not an unprimeable number, because it can be changed into a prime (101000150432513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3315051903 + ... + 3315082369.
It is an arithmetic number, because the mean of its divisors is an integer number (1445782221576).
Almost surely, 2101000150432512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101000150432512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104096319953472).
101000150432512 is an abundant number, since it is smaller than the sum of its proper divisors (107192489474432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000150432512 is a wasteful number, since it uses less digits than its factorization.
101000150432512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33066 (or 33052 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
The spelling of 101000150432512 in words is "one hundred one trillion, one hundred fifty million, four hundred thirty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •