Base | Representation |
---|---|
bin | 1100111011011101101… |
… | …10011111100001010101 |
3 | 1120110122221120212101111 |
4 | 12131232312133201111 |
5 | 24234301300111013 |
6 | 540025351055021 |
7 | 44044500453013 |
oct | 6355666374125 |
9 | 1513587525344 |
10 | 444241410133 |
11 | 161446770674 |
12 | 7211b671471 |
13 | 32b79337c31 |
14 | 17703ba58b3 |
15 | b85093e73d |
hex | 676ed9f855 |
444241410133 has 4 divisors (see below), whose sum is σ = 444244082688. Its totient is φ = 444238737580.
The previous prime is 444241410127. The next prime is 444241410259. The reversal of 444241410133 is 331014142444.
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-444241410133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 444241410095 and 444241410104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (444241410433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1069141 + ... + 1425322.
It is an arithmetic number, because the mean of its divisors is an integer number (111061020672).
Almost surely, 2444241410133 is an apocalyptic number.
It is an amenable number.
444241410133 is a deficient number, since it is larger than the sum of its proper divisors (2672555).
444241410133 is a wasteful number, since it uses less digits than its factorization.
444241410133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2672554.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 444241410133 its reverse (331014142444), we get a palindrome (775255552577).
The spelling of 444241410133 in words is "four hundred forty-four billion, two hundred forty-one million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •