Nerdulator> put something in

Recognised as Number

447,000,000,000,000,000,000

  • Positive
  • Even
  • Composite
  • 21 digits

447,000,000,000,000,000,000 is an even 21-digit integer and a composite number. It has 1,444 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Digit count21
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^18 × 3 × 5^18 × 149
Distinct prime factors42, 3, 5, 149
Number of divisors1,444
Sum of divisors σ(n)1,499,997,138,976,972,138,200
Aliquot sum1,052,997,138,976,972,138,200sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)118,400,000,000,000,000,000integers below n that share no factor with it
Carmichael function λ(n)1,850,000,000,000,000,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 118,400,000,000,000,000,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1,444 divisors, too many to listlisting is capped at 512

Arithmetic

Square199,809,000,000,000,000,000,000,000,000,000,000,000,000
Cube89,314,623,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
Square root21,142,374,511≈irrational, shown to 9 decimal places
Cube root7,646,027≈

Representations

Decimal447,000,000,000,000,000,000
Binary11000001110110101111100000011101100010100011110011100000000000000000069 bits
Octal60355370073050747000000
Hexadecimal183B5F03B1479C0000
Base 362MC3GZK50BVZEO
In wordsfour hundred and forty-seven quintillion
Ordinalfour hundred and forty-seven quintillionth
Engineering notation447 × 10^18

In other bases

Ternary11002022010021021120011210210120120110221120base 3; the most digit-efficient integer base after e: 44 digits
Quinary214444201433000000000000000000base 5; one hand: 30 digits
Septenary2222202200305425023543646base 7: 25 digits
Nonary4068107246153716513846base 9; each digit is two ternary digits: 22 digits
Duodecimal149588b483214382b680base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 20 digits
Vigesimaldcgah3f000000000base 20; hands and feet, and the Mayan and Yoruba systems: 16 digits
Sexagesimal12:19:15:22:35:16:52:20:44:26:40:0base 60; Babylonian, and still how an hour and a circle are divided: 12 digits
Balanced ternary1101T10T0101T110TTT01TTT11T11TT1TT011100TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000100110010100011000001001111000101011000111011000000000000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

Bit length69 bitsto write the magnitude
Set bits27the population count, or Hamming weight
Zero bits42within that length
Bit parityodd27 set bits, so odd; not the same as the number itself being even
Highest set bitbit 68worth 295,147,905,179,352,825,856
Lowest set bitbit 1818 trailing zeros
Power of twoNo
Bytes918 3b 5f 03 b1 47 9c 00 00
Gray code101000010011011110000100000100110100111100100010100100000000000000000n XOR (n >> 1); successive values differ in exactly one bit

Nearest landmarks

Previous prime446,999,999,999,999,999,999−1
Distance to nearest prime1
Nearest square below446,999,999,963,382,489,121
Nearest square above447,000,000,005,667,238,144

Powers & multiples

447,000,000,000,000,000,000 to the power 2199809000000000000000000000000… (42 digits)
447,000,000,000,000,000,000 to the power 3893146230000000000000000000000… (62 digits)
447,000,000,000,000,000,000 to the power 4399236364810000000000000000000… (83 digits)
447,000,000,000,000,000,000 to the power 5178458655070070000000000000000… (104 digits)
First ten multiples447,000,000,000,000,000,000, 894,000,000,000,000,000,000, 1,341,000,000,000,000,000,000, 1,788,000,000,000,000,000,000, 2,235,000,000,000,000,000,000, 2,682,000,000,000,000,000,000, 3,129,000,000,000,000,000,000, 3,576,000,000,000,000,000,000, 4,023,000,000,000,000,000,000, 4,470,000,000,000,000,000,000
Powers of twoBetween 2^68 (295,147,905,179,352,825,856) and 2^69 (590,295,810,358,705,651,712)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12Yes
Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1286the total stopping time
Highest value reached447,000,000,000,000,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps447,000,000,000,000,000,000 → 223,500,000,000,000,000,000 → 111,750,000,000,000,000,000 → 55,875,000,000,000,000,000 → 27,937,500,000,000,000,000 → 13,968,750,000,000,000,000 → 6,984,375,000,000,000,000 → 3,492,187,500,000,000,000 → 1,746,093,750,000,000,000 → 873,046,875,000,000,000 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “447000000000000000000” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.