Base | Representation |
---|---|
bin | 10110010011010010011001… |
… | …01000010010000111001101 |
3 | 20102122021222002121021200221 |
4 | 23021221030220102013031 |
5 | 22411442410341322333 |
6 | 252145120525551341 |
7 | 13221053126621224 |
oct | 1311511450220715 |
9 | 212567862537627 |
10 | 49041222214093 |
11 | 146982a148a82a |
12 | 5600626115551 |
13 | 214974b7ab2c5 |
14 | c17871c01cbb |
15 | 5a0a1c357d2d |
hex | 2c9a4ca121cd |
49041222214093 has 4 divisors (see below), whose sum is σ = 49041392156640. Its totient is φ = 49041052271548.
The previous prime is 49041222214043. The next prime is 49041222214129. The reversal of 49041222214093 is 39041222214094.
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-49041222214093 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 (49041222214043) 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, 84537673 + ... + 85115806.
It is an arithmetic number, because the mean of its divisors is an integer number (12260348039160).
Almost surely, 249041222214093 is an apocalyptic number.
It is an amenable number.
49041222214093 is a deficient number, since it is larger than the sum of its proper divisors (169942547).
49041222214093 is a wasteful number, since it uses less digits than its factorization.
49041222214093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169942546.
The product of its (nonzero) digits is 248832, while the sum is 43.
Subtracting from 49041222214093 its reverse (39041222214094), we obtain a palindrome (9999999999999).
The spelling of 49041222214093 in words is "forty-nine trillion, forty-one billion, two hundred twenty-two million, two hundred fourteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •