Recognised as Number

47,957,934,077

Positive
Odd
Prime
11 digits

47,957,934,077 is an odd 11-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value47,957,934,077

Digit count11

Digit sum62

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation47,957,934,077

Distinct prime factors147,957,934,077

Number of divisors2

Sum of divisors σ(n)47,957,934,078

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)47,957,934,076integers below n that share no factor with it

Carmichael function λ(n)47,957,934,076the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 47,957,934,0772 in total

Arithmetic

Previous number47,957,934,076

Next number47,957,934,078

Double95,915,868,154

Half23,978,967,038.5

Square2,299,963,440,933,877,841,929

Cube110,301,495,079,816,996,859,202,008,514,533

Square root218,993.000063929≈irrational, shown to 9 decimal places

Cube root3,633.179224616≈

Negation-47,957,934,077

Reciprocal2.08516071 × 10^-11≈

Representations

Decimal47,957,934,077

Binary10110010101010000011111111111111110136 bits

Octal545240777775

HexadecimalB2A83FFFD

Base 36M14WYRH

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty-seven billion, nine hundred and fifty-seven million, nine hundred and thirty-four thousand and seventy-seven

Ordinalforty-seven billion, nine hundred and fifty-seven million, nine hundred and thirty-four thousand and seventy-seventh

Scientific notation4.79579341 × 10^10

Engineering notation47.957934 × 10^9

In other bases

Ternary11120210021022110210122base 3; the most digit-efficient integer base after e: 23 digits

Quinary1241204212342302base 5; one hand: 16 digits

Septenary3315304466534base 7: 13 digits

Nonary146707273718base 9; each digit is two ternary digits: 12 digits

Duodecimal93650220a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits

Vigesimal1h96h1f3hbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits

Sexagesimal1:1:40:27:28:21:17base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

Balanced ternary1TTTT1T101T110T111T11T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1111101111111100001000000000000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000000000000101100101010100000111111111111111101

Bit length36 bitsto write the magnitude

Set bits24the population count, or Hamming weight

Zero bits12within that length

Bit parityeven24 set bits, so even; not the same as the number itself being odd

Highest set bitbit 35worth 34,359,738,368

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes50b 2a 83 ff fd

Gray code111010111111110000100000000000000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000000000000101100101010100000111111111111111101

One's complement1111111111111111111111111111010011010101011111000000000000000010at 64 bits, every bit flipped

Bits reversed1011111111111111110000010101010011010000000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000001011001010101000001111111111111111010at 64 bits, wrapping

Shifted left by 11011001010101000001111111111111111010= 95,915,868,154, no wrap

Shifted right by 110110010101010000011111111111111110= 23,978,967,038, discarding the low bit

These bits as a double2.36943677 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime47,957,934,091+14

Previous prime47,957,934,043−34

Distance to nearest prime0, it is prime

Nearest square below47,957,934,049

Nearest square above47,958,372,036

Powers & multiples

47,957,934,077 to the power 22,299,963,440,933,877,841,929

47,957,934,077 to the power 3110,301,495,079,816,996,859,202,008,514,533

47,957,934,077 to the power 4528983182963240338859772597516… (43 digits)

47,957,934,077 to the power 5253689406163927096853441155789… (54 digits)

First ten multiples47,957,934,077, 95,915,868,154, 143,873,802,231, 191,831,736,308, 239,789,670,385, 287,747,604,462, 335,705,538,539, 383,663,472,616, 431,621,406,693, 479,579,340,770

Powers of twoBetween 2^35 (34,359,738,368) and 2^36 (68,719,476,736)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1351the total stopping time

Highest value reached15,750,364,746,688328× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps47,957,934,077 → 143,873,802,232 → 71,936,901,116 → 35,968,450,558 → 17,984,225,279 → 53,952,675,838 → 26,976,337,919 → 80,929,013,758 → 40,464,506,879 → 121,393,520,638 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,795,793,407,700%

47,957,934,077% as a decimal479,579,340.77

47,957,934,077% of 10047,957,934,077

47,957,934,077% of 1,000479,579,340,770

As a fraction of 10047,957,934,077/100

Read another way

As seconds1,519 years, 253 days and 22 hours

As bytes44.664 GiB

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.