Base | Representation |
---|---|
bin | 101000001011011010… |
… | …000011111100110101 |
3 | 11010100120111121220111 |
4 | 220023122003330311 |
5 | 1201323102214021 |
6 | 31452502303021 |
7 | 3055034624254 |
oct | 501332037465 |
9 | 133316447814 |
10 | 43141054261 |
11 | 17329000658 |
12 | 843ba27a71 |
13 | 40b6a52c56 |
14 | 213381079b |
15 | 11c763e8e1 |
hex | a0b683f35 |
43141054261 has 8 divisors (see below), whose sum is σ = 43967012544. Its totient is φ = 42322925280.
The previous prime is 43141054247. The next prime is 43141054279. The reversal of 43141054261 is 16245014134.
43141054261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 43141054261 - 27 = 43141054133 is a prime.
It is a super-2 number, since 2×431410542612 (a number of 22 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 (43141057261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1946200 + ... + 1968241.
It is an arithmetic number, because the mean of its divisors is an integer number (5495876568).
Almost surely, 243141054261 is an apocalyptic number.
It is an amenable number.
43141054261 is a deficient number, since it is larger than the sum of its proper divisors (825958283).
43141054261 is a wasteful number, since it uses less digits than its factorization.
43141054261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3914651.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 43141054261 its reverse (16245014134), we get a palindrome (59386068395).
The spelling of 43141054261 in words is "forty-three billion, one hundred forty-one million, fifty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •