Base | Representation |
---|---|
bin | 10010110001011110111000… |
… | …11110001110010000101010 |
3 | 12102011120200102210022112010 |
4 | 21120233130132032100222 |
5 | 20402333311133421411 |
6 | 223444551143500350 |
7 | 11460400021511460 |
oct | 1130573436162052 |
9 | 172146612708463 |
10 | 41282629592106 |
11 | 12176957194761 |
12 | 4768a251576b6 |
13 | 1a05c20a1b626 |
14 | a2a138ac4830 |
15 | 4b8cc8b9e7a6 |
hex | 258bdc78e42a |
41282629592106 has 32 divisors (see below), whose sum is σ = 94360565559168. Its totient is φ = 11795003357760.
The previous prime is 41282629592077. The next prime is 41282629592129. The reversal of 41282629592106 is 60129592628214.
41282629592106 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16036636 + ... + 18432008.
It is an arithmetic number, because the mean of its divisors is an integer number (2948767673724).
Almost surely, 241282629592106 is an apocalyptic number.
41282629592106 is an abundant number, since it is smaller than the sum of its proper divisors (53077935967062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41282629592106 is a wasteful number, since it uses less digits than its factorization.
41282629592106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2805726.
The product of its (nonzero) digits is 7464960, while the sum is 57.
The spelling of 41282629592106 in words is "forty-one trillion, two hundred eighty-two billion, six hundred twenty-nine million, five hundred ninety-two thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •