Base | Representation |
---|---|
bin | 10010110001111111010001… |
… | …00011010110001101000110 |
3 | 12102020020112212002210100012 |
4 | 21120333220203112031012 |
5 | 20403124411101144032 |
6 | 223500544051550222 |
7 | 11461553541612032 |
oct | 1130775043261506 |
9 | 172206485083305 |
10 | 41300012131142 |
11 | 121832671825a6 |
12 | 47702765bb372 |
13 | 1a0776104b79b |
14 | a2ad075011c2 |
15 | 4b9494c3b6b2 |
hex | 258fe88d6346 |
41300012131142 has 16 divisors (see below), whose sum is σ = 64657789747200. Its totient is φ = 19747812562632.
The previous prime is 41300012131141. The next prime is 41300012131153. The reversal of 41300012131142 is 24113121000314.
41300012131142 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 (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41300012131141) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 99043142 + ... + 99459257.
It is an arithmetic number, because the mean of its divisors is an integer number (4041111859200).
Almost surely, 241300012131142 is an apocalyptic number.
41300012131142 is a deficient number, since it is larger than the sum of its proper divisors (23357777616058).
41300012131142 is a wasteful number, since it uses less digits than its factorization.
41300012131142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198506947.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 41300012131142 its reverse (24113121000314), we get a palindrome (65413133131456).
The spelling of 41300012131142 in words is "forty-one trillion, three hundred billion, twelve million, one hundred thirty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.046 sec. • engine limits •