Base | Representation |
---|---|
bin | 10011001100110011000000… |
… | …11010011011111100111101 |
3 | 12112111022011021002211102122 |
4 | 21212121200122123330331 |
5 | 21013222401343001103 |
6 | 225444043212532325 |
7 | 11615243234054165 |
oct | 1146314032337475 |
9 | 175438137084378 |
10 | 42221146062653 |
11 | 124a8984281998 |
12 | 489a8a84810a5 |
13 | 1a7358b0b37bc |
14 | a5d72b6215a5 |
15 | 4d340781db38 |
hex | 26666069bf3d |
42221146062653 has 4 divisors (see below), whose sum is σ = 42227817130140. Its totient is φ = 42214474995168.
The previous prime is 42221146062649. The next prime is 42221146062727. The reversal of 42221146062653 is 35626064112224.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 31465514204569 + 10755631858084 = 5609413^2 + 3279578^2 .
It is a cyclic number.
It is not a de Polignac number, because 42221146062653 - 22 = 42221146062649 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 (42221146362653) 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, 3335524250 + ... + 3335536907.
It is an arithmetic number, because the mean of its divisors is an integer number (10556954282535).
Almost surely, 242221146062653 is an apocalyptic number.
It is an amenable number.
42221146062653 is a deficient number, since it is larger than the sum of its proper divisors (6671067487).
42221146062653 is an equidigital number, since it uses as much as digits as its factorization.
42221146062653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6671067486.
The product of its (nonzero) digits is 829440, while the sum is 44.
The spelling of 42221146062653 in words is "forty-two trillion, two hundred twenty-one billion, one hundred forty-six million, sixty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •