Base | Representation |
---|---|
bin | 10010111001010111011110… |
… | …00000101011011101010011 |
3 | 12110010110220111120102020202 |
4 | 21130223233000223131103 |
5 | 20421303104012213011 |
6 | 224213231501325415 |
7 | 11516100023265431 |
oct | 1134535700533523 |
9 | 173113814512222 |
10 | 41553523554131 |
11 | 12270828825916 |
12 | 47b1426b6686b |
13 | 1a25632746454 |
14 | a392b6405d51 |
15 | 4c0d80e6c23b |
hex | 25caef02b753 |
41553523554131 has 4 divisors (see below), whose sum is σ = 42567024128664. Its totient is φ = 40540022979600.
The previous prime is 41553523554121. The next prime is 41553523554199. The reversal of 41553523554131 is 13145532535514.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41553523554131 - 210 = 41553523553107 is a prime.
It is a super-2 number, since 2×415535235541312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41553523554121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 506750287205 + ... + 506750287286.
It is an arithmetic number, because the mean of its divisors is an integer number (10641756032166).
Almost surely, 241553523554131 is an apocalyptic number.
41553523554131 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
41553523554131 is a deficient number, since it is larger than the sum of its proper divisors (1013500574533).
41553523554131 is a wasteful number, since it uses less digits than its factorization.
41553523554131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013500574532.
The product of its digits is 2700000, while the sum is 47.
The spelling of 41553523554131 in words is "forty-one trillion, five hundred fifty-three billion, five hundred twenty-three million, five hundred fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •