Base | Representation |
---|---|
bin | 10011110110101100111101… |
… | …10000011100110110011011 |
3 | 12201120221200120201112210121 |
4 | 21323112132300130312123 |
5 | 21210320220023040201 |
6 | 232505331141454111 |
7 | 12124255301124604 |
oct | 1173263660346633 |
9 | 181527616645717 |
10 | 43661006065051 |
11 | 12a0358a757a21 |
12 | 4a91966711337 |
13 | 1b492a4a639bb |
14 | aad2bd994dab |
15 | 50aaca00e9a1 |
hex | 27b59ec1cd9b |
43661006065051 has 4 divisors (see below), whose sum is σ = 43661243574504. Its totient is φ = 43660768555600.
The previous prime is 43661006065009. The next prime is 43661006065069. The reversal of 43661006065051 is 15056060016634.
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 43661006065051 - 227 = 43660871847323 is a prime.
It is a super-2 number, since 2×436610060650512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 43661006064989 and 43661006065007.
It is not an unprimeable number, because it can be changed into a prime (43661006065751) 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, 118478770 + ... + 118846711.
It is an arithmetic number, because the mean of its divisors is an integer number (10915310893626).
Almost surely, 243661006065051 is an apocalyptic number.
43661006065051 is a deficient number, since it is larger than the sum of its proper divisors (237509453).
43661006065051 is a wasteful number, since it uses less digits than its factorization.
43661006065051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237509452.
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 43661006065051 in words is "forty-three trillion, six hundred sixty-one billion, six million, sixty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •