Base | Representation |
---|---|
bin | 100110001100101000… |
… | …110011101100010101 |
3 | 10220212100110220201122 |
4 | 212030220303230111 |
5 | 1132444114312042 |
6 | 30501444533325 |
7 | 2651241030113 |
oct | 461450635425 |
9 | 126770426648 |
10 | 41014213397 |
11 | 164374aa633 |
12 | 7b476b1245 |
13 | 3b38228031 |
14 | 1db1178ab3 |
15 | 1100a747d2 |
hex | 98ca33b15 |
41014213397 has 4 divisors (see below), whose sum is σ = 41017990860. Its totient is φ = 41010435936.
The previous prime is 41014213393. The next prime is 41014213489. The reversal of 41014213397 is 79331241014.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 79331241014 = 2 ⋅39665620507.
It can be written as a sum of positive squares in 2 ways, for example, as 18573873796 + 22440339601 = 136286^2 + 149801^2 .
It is a cyclic number.
It is not a de Polignac number, because 41014213397 - 22 = 41014213393 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41014213391) 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 3 ways as a sum of consecutive naturals, for example, 1872398 + ... + 1894175.
It is an arithmetic number, because the mean of its divisors is an integer number (10254497715).
Almost surely, 241014213397 is an apocalyptic number.
It is an amenable number.
41014213397 is a deficient number, since it is larger than the sum of its proper divisors (3777463).
41014213397 is a wasteful number, since it uses less digits than its factorization.
41014213397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3777462.
The product of its (nonzero) digits is 18144, while the sum is 35.
The spelling of 41014213397 in words is "forty-one billion, fourteen million, two hundred thirteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •