Base | Representation |
---|---|
bin | 101111000011000000… |
… | …0000111101100000010 |
3 | 100122210010100000210200 |
4 | 1132012000013230002 |
5 | 3123403300114432 |
6 | 114225203310030 |
7 | 10204451311356 |
oct | 1360600075402 |
9 | 318703300720 |
10 | 101032426242 |
11 | 39936197230 |
12 | 176b767b316 |
13 | 96b1691047 |
14 | 4c6620d466 |
15 | 2964bc3a7c |
hex | 1786007b02 |
101032426242 has 96 divisors (see below), whose sum is σ = 251959818240. Its totient is φ = 28936764000.
The previous prime is 101032426241. The next prime is 101032426259. The reversal of 101032426242 is 242624230101.
101032426242 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 32 + 4 + 2 + 624 + 2 = 666.
It is not an unprimeable number, because it can be changed into a prime (101032426241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1590267 + ... + 1652577.
It is an arithmetic number, because the mean of its divisors is an integer number (2624581440).
Almost surely, 2101032426242 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101032426242, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125979909120).
101032426242 is an abundant number, since it is smaller than the sum of its proper divisors (150927391998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101032426242 is a wasteful number, since it uses less digits than its factorization.
101032426242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62780 (or 62777 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 101032426242 its reverse (242624230101), we get a palindrome (343656656343).
The spelling of 101032426242 in words is "one hundred one billion, thirty-two million, four hundred twenty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •