Base | Representation |
---|---|
bin | 10010111011000001001011… |
… | …00100111101100110110100 |
3 | 12110022220101111210221222220 |
4 | 21131200211210331212310 |
5 | 20423220320021011124 |
6 | 224255255032122340 |
7 | 11523146240641020 |
oct | 1135404544754664 |
9 | 173286344727886 |
10 | 41610273610164 |
11 | 122928aa747976 |
12 | 48004245363b0 |
13 | 1a2aaa7a9906c |
14 | a3bd3b3cd380 |
15 | 4c25a3208879 |
hex | 25d82593d9b4 |
41610273610164 has 48 divisors (see below), whose sum is σ = 110961182898048. Its totient is φ = 11888601038208.
The previous prime is 41610273609953. The next prime is 41610273610193. The reversal of 41610273610164 is 46101637201614.
41610273610164 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 (42).
It is a congruent 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, 23063722 + ... + 24802334.
It is an arithmetic number, because the mean of its divisors is an integer number (2311691310376).
Almost surely, 241610273610164 is an apocalyptic number.
It is an amenable number.
41610273610164 is an abundant number, since it is smaller than the sum of its proper divisors (69350909287884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41610273610164 is a wasteful number, since it uses less digits than its factorization.
41610273610164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2023544 (or 2023542 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 42.
The spelling of 41610273610164 in words is "forty-one trillion, six hundred ten billion, two hundred seventy-three million, six hundred ten thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •