Base | Representation |
---|---|
bin | 10011101111000111100011… |
… | …01111100010000010111101 |
3 | 12200200001000212110110022211 |
4 | 21313203301233202002331 |
5 | 21142033012230444221 |
6 | 232145512043340421 |
7 | 12066401334324235 |
oct | 1167436157420275 |
9 | 180601025413284 |
10 | 43400405328061 |
11 | 129130103a8111 |
12 | 4a4b357b21711 |
13 | 1b2a8436c1492 |
14 | aa083b324cc5 |
15 | 503e267216e1 |
hex | 2778f1be20bd |
43400405328061 has 4 divisors (see below), whose sum is σ = 43731706132224. Its totient is φ = 43069104523900.
The previous prime is 43400405328053. The next prime is 43400405328067. The reversal of 43400405328061 is 16082350400434.
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 43400405328061 - 23 = 43400405328053 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 (43400405328067) 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, 165650401885 + ... + 165650402146.
It is an arithmetic number, because the mean of its divisors is an integer number (10932926533056).
Almost surely, 243400405328061 is an apocalyptic number.
It is an amenable number.
43400405328061 is a deficient number, since it is larger than the sum of its proper divisors (331300804163).
43400405328061 is a wasteful number, since it uses less digits than its factorization.
43400405328061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 331300804162.
The product of its (nonzero) digits is 276480, while the sum is 40.
Adding to 43400405328061 its reverse (16082350400434), we get a palindrome (59482755728495).
The spelling of 43400405328061 in words is "forty-three trillion, four hundred billion, four hundred five million, three hundred twenty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.667 sec. • engine limits •