Base | Representation |
---|---|
bin | 100110101011101100… |
… | …010000111000101110 |
3 | 10222012122211102222000 |
4 | 212223230100320232 |
5 | 1140031003304402 |
6 | 31025255433130 |
7 | 3000165325515 |
oct | 465354207056 |
9 | 128178742860 |
10 | 41535213102 |
11 | 166845aa3a9 |
12 | 80720857a6 |
13 | 3bbc153596 |
14 | 202043967c |
15 | 1131689c1c |
hex | 9abb10e2e |
41535213102 has 32 divisors (see below), whose sum is σ = 92320044960. Its totient is φ = 13842135360.
The previous prime is 41535213079. The next prime is 41535213107. The reversal of 41535213102 is 20131253514.
41535213102 is a `hidden beast` number, since 4 + 1 + 535 + 21 + 3 + 102 = 666.
41535213102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41535213107) 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, 183378 + ... + 341610.
It is an arithmetic number, because the mean of its divisors is an integer number (2885001405).
Almost surely, 241535213102 is an apocalyptic number.
41535213102 is an abundant number, since it is smaller than the sum of its proper divisors (50784831858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41535213102 is a wasteful number, since it uses less digits than its factorization.
41535213102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163105 (or 163099 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 41535213102 its reverse (20131253514), we get a palindrome (61666466616).
The spelling of 41535213102 in words is "forty-one billion, five hundred thirty-five million, two hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •