Base | Representation |
---|---|
bin | 10010111100111101100111… |
… | …11110001011010010011111 |
3 | 12110120021211212011121100022 |
4 | 21132132303332023102133 |
5 | 20430314133244001134 |
6 | 224350104533022355 |
7 | 11531033033116604 |
oct | 1136366376132237 |
9 | 173507755147308 |
10 | 41677087093919 |
11 | 12309176166142 |
12 | 48113701849bb |
13 | 1a34194cb6334 |
14 | a41278b2a6ab |
15 | 4c41b3bd152e |
hex | 25e7b3f8b49f |
41677087093919 has 8 divisors (see below), whose sum is σ = 43496819445120. Its totient is φ = 39857995166616.
The previous prime is 41677087093909. The next prime is 41677087093927. The reversal of 41677087093919 is 91939078077614.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41677087093919 - 24 = 41677087093903 is a prime.
It is a super-2 number, since 2×416770870939192 (a number of 28 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 (41677087093909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159972977 + ... + 160233290.
It is an arithmetic number, because the mean of its divisors is an integer number (5437102430640).
Almost surely, 241677087093919 is an apocalyptic number.
41677087093919 is a deficient number, since it is larger than the sum of its proper divisors (1819732351201).
41677087093919 is a wasteful number, since it uses less digits than its factorization.
41677087093919 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320211949.
The product of its (nonzero) digits is 144027072, while the sum is 71.
The spelling of 41677087093919 in words is "forty-one trillion, six hundred seventy-seven billion, eighty-seven million, ninety-three thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •