Base | Representation |
---|---|
bin | 10010110001000100101000… |
… | …01001110010011001010011 |
3 | 12102010020021220111121120001 |
4 | 21120202110021302121103 |
5 | 20402120423012424101 |
6 | 223434300202030431 |
7 | 11456360451600661 |
oct | 1130422411623123 |
9 | 172106256447501 |
10 | 41268531373651 |
11 | 1217098210154a |
12 | 476614b7a8417 |
13 | 1a047b4c70b2a |
14 | a2959c561c31 |
15 | 4b8751119901 |
hex | 258894272653 |
41268531373651 has 4 divisors (see below), whose sum is σ = 41383485500400. Its totient is φ = 41153577246904.
The previous prime is 41268531373639. The next prime is 41268531373673. The reversal of 41268531373651 is 15637313586214.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41268531373651 - 219 = 41268530849363 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41268531373592 and 41268531373601.
It is not an unprimeable number, because it can be changed into a prime (41268531379651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57477062836 + ... + 57477063553.
It is an arithmetic number, because the mean of its divisors is an integer number (10345871375100).
Almost surely, 241268531373651 is an apocalyptic number.
41268531373651 is a deficient number, since it is larger than the sum of its proper divisors (114954126749).
41268531373651 is a wasteful number, since it uses less digits than its factorization.
41268531373651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114954126748.
The product of its digits is 10886400, while the sum is 55.
The spelling of 41268531373651 in words is "forty-one trillion, two hundred sixty-eight billion, five hundred thirty-one million, three hundred seventy-three thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •