Base | Representation |
---|---|
bin | 10100110000011110100… |
… | …000000111101111111111 |
3 | 12001100220010011121211111 |
4 | 110300132200013233333 |
5 | 141332322331112403 |
6 | 3011144202302451 |
7 | 205025351263102 |
oct | 24603640075777 |
9 | 5040803147744 |
10 | 1426440879103 |
11 | 4aaa4a764099 |
12 | 1b05541b7a27 |
13 | a4688802876 |
14 | 4d07c0a6739 |
15 | 2718959e56d |
hex | 14c1e807bff |
1426440879103 has 8 divisors (see below), whose sum is σ = 1453464777600. Its totient is φ = 1399421051808.
The previous prime is 1426440879089. The next prime is 1426440879113. The reversal of 1426440879103 is 3019780446241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1426440879103 is a prime.
It is a super-2 number, since 2×14264408791032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1426440879113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 305743 + ... + 1716496.
It is an arithmetic number, because the mean of its divisors is an integer number (181683097200).
Almost surely, 21426440879103 is an apocalyptic number.
1426440879103 is a deficient number, since it is larger than the sum of its proper divisors (27023898497).
1426440879103 is a wasteful number, since it uses less digits than its factorization.
1426440879103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035601.
The product of its (nonzero) digits is 1161216, while the sum is 49.
The spelling of 1426440879103 in words is "one trillion, four hundred twenty-six billion, four hundred forty million, eight hundred seventy-nine thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •