Base | Representation |
---|---|
bin | 1110111100100110000011… |
… | …0111110111010010111001 |
3 | 2011012002110120110201021120 |
4 | 3233021200313313102321 |
5 | 4123224140023203031 |
6 | 54541430432455453 |
7 | 3314221025156523 |
oct | 357114067672271 |
9 | 64162416421246 |
10 | 16434170131641 |
11 | 5266768668489 |
12 | 1a150763aa589 |
13 | 92297413a352 |
14 | 40b5bd2c8a13 |
15 | 1d775557ca96 |
hex | ef260df74b9 |
16434170131641 has 4 divisors (see below), whose sum is σ = 21912226842192. Its totient is φ = 10956113421092.
The previous prime is 16434170131633. The next prime is 16434170131679. The reversal of 16434170131641 is 14613107143461.
It is a happy number.
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 not a de Polignac number, because 16434170131641 - 23 = 16434170131633 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16434170131593 and 16434170131602.
It is not an unprimeable number, because it can be changed into a prime (16434170130641) 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, 2739028355271 + ... + 2739028355276.
It is an arithmetic number, because the mean of its divisors is an integer number (5478056710548).
Almost surely, 216434170131641 is an apocalyptic number.
It is an amenable number.
16434170131641 is a deficient number, since it is larger than the sum of its proper divisors (5478056710551).
16434170131641 is an equidigital number, since it uses as much as digits as its factorization.
16434170131641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5478056710550.
The product of its (nonzero) digits is 145152, while the sum is 42.
The spelling of 16434170131641 in words is "sixteen trillion, four hundred thirty-four billion, one hundred seventy million, one hundred thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •