Base | Representation |
---|---|
bin | 1100001110111010101111… |
… | …0101000000010001001011 |
3 | 1202121211220021100202100012 |
4 | 3003232223311000101023 |
5 | 3230332432400334233 |
6 | 44335012400102135 |
7 | 2555522036346461 |
oct | 303565365002113 |
9 | 52554807322305 |
10 | 13450425402443 |
11 | 4316325540307 |
12 | 161294830494b |
13 | 7674a62301a3 |
14 | 34700b212831 |
15 | 184d22e55548 |
hex | c3babd4044b |
13450425402443 has 4 divisors (see below), whose sum is σ = 13454880663960. Its totient is φ = 13445970140928.
The previous prime is 13450425402391. The next prime is 13450425402473. The reversal of 13450425402443 is 34420452405431.
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 13450425402443 - 210 = 13450425401419 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13450425402443.
It is not an unprimeable number, because it can be changed into a prime (13450425402473) 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, 2227626230 + ... + 2227632267.
It is an arithmetic number, because the mean of its divisors is an integer number (3363720165990).
Almost surely, 213450425402443 is an apocalyptic number.
13450425402443 is a deficient number, since it is larger than the sum of its proper divisors (4455261517).
13450425402443 is an equidigital number, since it uses as much as digits as its factorization.
13450425402443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4455261516.
The product of its (nonzero) digits is 921600, while the sum is 41.
Adding to 13450425402443 its reverse (34420452405431), we get a palindrome (47870877807874).
The spelling of 13450425402443 in words is "thirteen trillion, four hundred fifty billion, four hundred twenty-five million, four hundred two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •