Base | Representation |
---|---|
bin | 100110001100011010… |
… | …010000110000111001 |
3 | 10220212002022012011022 |
4 | 212030122100300321 |
5 | 1132442130302223 |
6 | 30501231112225 |
7 | 2651163436211 |
oct | 461432206071 |
9 | 126762265138 |
10 | 41010400313 |
11 | 16435335823 |
12 | 7b46372675 |
13 | 3b374c157c |
14 | 1db0865241 |
15 | 110056eac8 |
hex | 98c690c39 |
41010400313 has 8 divisors (see below), whose sum is σ = 43424569800. Its totient is φ = 38596430080.
The previous prime is 41010400307. The next prime is 41010400349. The reversal of 41010400313 is 31300401014.
It can be written as a sum of positive squares in 4 ways, for example, as 322669369 + 40687730944 = 17963^2 + 201712^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41010400313 - 24 = 41010400297 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41010400291 and 41010400300.
It is not an unprimeable number, because it can be changed into a prime (41010405313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 677303 + ... + 735363.
It is an arithmetic number, because the mean of its divisors is an integer number (5428071225).
Almost surely, 241010400313 is an apocalyptic number.
It is an amenable number.
41010400313 is a deficient number, since it is larger than the sum of its proper divisors (2414169487).
41010400313 is a wasteful number, since it uses less digits than its factorization.
41010400313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99627.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 41010400313 its reverse (31300401014), we get a palindrome (72310801327).
The spelling of 41010400313 in words is "forty-one billion, ten million, four hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •