Base | Representation |
---|---|
bin | 1001111000011… |
… | …1111110011101 |
3 | 2212222221122211 |
4 | 2132013332131 |
5 | 41102421141 |
6 | 4040240421 |
7 | 1012221424 |
oct | 236077635 |
9 | 85887584 |
10 | 41451421 |
11 | 21442080 |
12 | 11a70111 |
13 | 878438b |
14 | 57102bb |
15 | 398bd81 |
hex | 2787f9d |
41451421 has 4 divisors (see below), whose sum is σ = 45219744. Its totient is φ = 37683100.
The previous prime is 41451409. The next prime is 41451427. The reversal of 41451421 is 12415414.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41451421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41451392 and 41451401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41451427) 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, 1884145 + ... + 1884166.
It is an arithmetic number, because the mean of its divisors is an integer number (11304936).
Almost surely, 241451421 is an apocalyptic number.
It is an amenable number.
41451421 is a deficient number, since it is larger than the sum of its proper divisors (3768323).
41451421 is a wasteful number, since it uses less digits than its factorization.
41451421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3768322.
The product of its digits is 640, while the sum is 22.
The square root of 41451421 is about 6438.2777976723. The cubic root of 41451421 is about 346.0826342108.
Adding to 41451421 its reverse (12415414), we get a palindrome (53866835).
The spelling of 41451421 in words is "forty-one million, four hundred fifty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •