Base | Representation |
---|---|
bin | 100110110000010101… |
… | …001101100000011111 |
3 | 10222102002022021101110 |
4 | 212300111031200133 |
5 | 1140210420243111 |
6 | 31041120113103 |
7 | 3002132066031 |
oct | 466025154037 |
9 | 128362267343 |
10 | 41613056031 |
11 | 167145379a8 |
12 | 8094165793 |
13 | 3c02309ba1 |
14 | 202a8ddc51 |
15 | 11384145a6 |
hex | 9b054d81f |
41613056031 has 16 divisors (see below), whose sum is σ = 55796139360. Its totient is φ = 27586321920.
The previous prime is 41613056011. The next prime is 41613056041. The reversal of 41613056031 is 13065031614.
It is not a de Polignac number, because 41613056031 - 211 = 41613053983 is a prime.
It is a super-3 number, since 3×416130560313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 41613056031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41613056011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 492825 + ... + 571053.
It is an arithmetic number, because the mean of its divisors is an integer number (3487258710).
Almost surely, 241613056031 is an apocalyptic number.
41613056031 is a deficient number, since it is larger than the sum of its proper divisors (14183083329).
41613056031 is a wasteful number, since it uses less digits than its factorization.
41613056031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79226.
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 41613056031 its reverse (13065031614), we get a palindrome (54678087645).
The spelling of 41613056031 in words is "forty-one billion, six hundred thirteen million, fifty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •