Base | Representation |
---|---|
bin | 101000101011100110… |
… | …000100101110110101 |
3 | 11011202012122110212022 |
4 | 220223212010232311 |
5 | 1203424323332401 |
6 | 32022233002525 |
7 | 3104313001160 |
oct | 505346045665 |
9 | 134665573768 |
10 | 43681074101 |
11 | 17585911545 |
12 | 8570853445 |
13 | 41718aa912 |
14 | 2185422ad7 |
15 | 1209c6071b |
hex | a2b984bb5 |
43681074101 has 4 divisors (see below), whose sum is σ = 49921227552. Its totient is φ = 37440920652.
The previous prime is 43681074061. The next prime is 43681074139. The reversal of 43681074101 is 10147018634.
It is a happy number.
43681074101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10147018634 = 2 ⋅5073509317.
It is a cyclic number.
It is not a de Polignac number, because 43681074101 - 222 = 43676879797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43681074401) 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, 3120076715 + ... + 3120076728.
It is an arithmetic number, because the mean of its divisors is an integer number (12480306888).
Almost surely, 243681074101 is an apocalyptic number.
It is an amenable number.
43681074101 is a deficient number, since it is larger than the sum of its proper divisors (6240153451).
43681074101 is an equidigital number, since it uses as much as digits as its factorization.
43681074101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6240153450.
The product of its (nonzero) digits is 16128, while the sum is 35.
The spelling of 43681074101 in words is "forty-three billion, six hundred eighty-one million, seventy-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •