Base | Representation |
---|---|
bin | 10010101001101001001111… |
… | …10011010001001000000111 |
3 | 12101012211112010022212220012 |
4 | 21110310213303101020013 |
5 | 20333430224434213143 |
6 | 223121131004100435 |
7 | 11432054031614600 |
oct | 1124644763211007 |
9 | 171184463285805 |
10 | 41013310460423 |
11 | 120827135a3984 |
12 | 47247a283471b |
13 | 19b6700356092 |
14 | a1b0aa5c4da7 |
15 | 4b1cb4cad418 |
hex | 254d27cd1207 |
41013310460423 has 12 divisors (see below), whose sum is σ = 47813758025472. Its totient is φ = 35077342093920.
The previous prime is 41013310460411. The next prime is 41013310460459. The reversal of 41013310460423 is 32406401331014.
It is not a de Polignac number, because 41013310460423 - 216 = 41013310394887 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41013310460423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41013310460623) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 915739463 + ... + 915784248.
It is an arithmetic number, because the mean of its divisors is an integer number (3984479835456).
Almost surely, 241013310460423 is an apocalyptic number.
41013310460423 is a deficient number, since it is larger than the sum of its proper divisors (6800447565049).
41013310460423 is a wasteful number, since it uses less digits than its factorization.
41013310460423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1831524182 (or 1831524175 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 41013310460423 its reverse (32406401331014), we get a palindrome (73419711791437).
The spelling of 41013310460423 in words is "forty-one trillion, thirteen billion, three hundred ten million, four hundred sixty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •