Nerdulator> put something in

Recognised as Number

422,000,000,017

  • Positive
  • Odd
  • Prime
  • 12 digits

422,000,000,017 is an odd 12-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value422,000,000,017
Digit count12
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation422,000,000,017
Distinct prime factors1422,000,000,017
Number of divisors2
Sum of divisors σ(n)422,000,000,018
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)422,000,000,016integers below n that share no factor with it
Carmichael function λ(n)422,000,000,016the 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, 422,000,000,0172 in total

Arithmetic

Previous number422,000,000,016
Next number422,000,000,018
Square178,084,000,014,348,000,000,289
Cube75,151,448,009,082,284,000,365,874,000,004,913
Square root649,615.270769553≈irrational, shown to 9 decimal places
Cube root7,500.740667694≈
Reciprocal2.36966825 × 10^-12≈

Representations

Decimal422,000,000,017
Binary11000100100000100101000111111000001000139 bits
Octal6110112176021
Hexadecimal624128FC11
Base 365DV3WJYP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour hundred and twenty-two billion and seventeen
Ordinalfour hundred and twenty-two billion and seventeenth
Scientific notation4.22 × 10^11
Engineering notation422 × 10^9

In other bases

Ternary1111100020220110011111021base 3; the most digit-efficient integer base after e: 25 digits
Quinary23403224000000032base 5; one hand: 17 digits
Septenary42326360546521base 7: 14 digits
Nonary1440226404437base 9; each digit is two ternary digits: 13 digits
Duodecimal69952b42b81base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalg9df0000hbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal9:2:41:43:42:13:37base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11111001T10T01100111111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011001000001011110010000110000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000000000110001001000001001010001111110000010001
Bit length39 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits24within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes562 41 28 fc 11
Gray code101001101100001101111001000001000011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000000000110001001000001001010001111110000010001
One's complement1111111111111111111111111001110110111110110101110000001111101110at 64 bits, every bit flipped
Bits reversed1000100000111111000101001000001001000110000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001100010010000010010100011111100000100010at 64 bits, wrapping
Shifted left by 11100010010000010010100011111100000100010= 844,000,000,034, no wrap
Shifted right by 111000100100000100101000111111000001000= 211,000,000,008, discarding the low bit
These bits as a double2.08495703 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime422,000,000,029+12
Previous prime421,999,999,957−60
Distance to nearest prime0, it is prime
Nearest square below421,999,648,225
Nearest square above422,000,947,456

Powers & multiples

422,000,000,017 to the power 2178,084,000,014,348,000,000,289
422,000,000,017 to the power 375,151,448,009,082,284,000,365,874,000,004,913
422,000,000,017 to the power 4317139110611102984643087976560… (47 digits)
422,000,000,017 to the power 5133832704683276824399771876847… (59 digits)
First ten multiples422,000,000,017, 844,000,000,034, 1,266,000,000,051, 1,688,000,000,068, 2,110,000,000,085, 2,532,000,000,102, 2,954,000,000,119, 3,376,000,000,136, 3,798,000,000,153, 4,220,000,000,170
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1243the total stopping time
Highest value reached1,266,000,000,0523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps422,000,000,017 → 1,266,000,000,052 → 633,000,000,026 → 316,500,000,013 → 949,500,000,040 → 474,750,000,020 → 237,375,000,010 → 118,687,500,005 → 356,062,500,016 → 178,031,250,008 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage42,200,000,001,700%
422,000,000,017% as a decimal4,220,000,000.17
422,000,000,017% of 100422,000,000,017
422,000,000,017% of 1,0004,220,000,000,170
As a fraction of 100422,000,000,017/100

Read another way

Keep nerding

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

Also reads as

422000000017 (identifier)

  • 12 characters
  • Checksum valid

422000000017 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for GTIN-12 (UPC-A). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

Checksum tests

Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit validGS1 mod 10, weights 3 and 1 alternating from the right

What this does not tell you

ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked

Nerdulate something else

Nothing in mind? Surprise me · today’s page

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