Nerdulator> put something in

Recognised as Number

742,032,356,569

  • Positive
  • Odd
  • Composite
  • Perfect square
  • 12 digits

742,032,356,569 is an odd 12-digit integer and a composite number. It has 9 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value742,032,356,569
Digit count12
Digit sum52
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
Perfect squareYes, 861,413²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7^2 × 123,059^2
Distinct prime factors27, 123,059
Number of divisors9
Sum of divisors σ(n)863,187,510,837
Aliquot sum121,155,154,268sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)636,022,565,724integers below n that share no factor with it
Carmichael function λ(n)318,011,282,862the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 636,022,565,724
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 49, 123,059, 861,413, 6,029,891, 15,143,517,481, 106,004,622,367, 742,032,356,5699 in total

Arithmetic

Previous number742,032,356,568
Next number742,032,356,570
Square550,612,018,195,343,557,451,761
Cube408,571,933,416,703,886,518,502,055,368,968,009
Square root861,413exact
Cube root9,053.314645418≈
Reciprocal1.34765013 × 10^-12≈

Representations

Decimal742,032,356,569
Binary101011001100010010010011001101001101100140 bits
Octal12630444632331
HexadecimalACC49334D9
Base 369GVUWMOP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and forty-two billion, thirty-two million, three hundred and fifty-six thousand, five hundred and sixty-nine
Ordinalseven hundred and forty-two billion, thirty-two million, three hundred and fifty-six thousand, five hundred and sixty-ninth
Scientific notation7.42032357 × 10^11
Engineering notation742.032357 × 10^9

In other bases

Ternary2121221022111210100022221base 3; the most digit-efficient integer base after e: 25 digits
Quinary44124140240402234base 5; one hand: 17 digits
Septenary104416152651100base 7: 15 digits
Nonary2557274710287base 9; each digit is two ternary digits: 13 digits
Duodecimalbb989175021base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal18je524b89base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal15:54:15:34:59:2:49base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T0T0T1100TTTT101001000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110111000101100101110111010100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000000001010110011000100100100110011010011011001
Bit length40 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits21within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes5ac c4 93 34 d9
Gray code1111101010100110110110101010111010110101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000000001010110011000100100100110011010011011001
One's complement1111111111111111111111110101001100111011011011001100101100100110at 64 bits, every bit flipped
Bits reversed1001101100101100110010010010001100110101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010101100110001001001001100110100110110010at 64 bits, wrapping
Shifted left by 110101100110001001001001100110100110110010= 1,484,064,713,138, no wrap
Shifted right by 1101011001100010010010011001101001101100= 371,016,178,284, discarding the low bit
These bits as a double3.66612695 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime742,032,356,581+12
Previous prime742,032,356,563−6
Distance to nearest prime6
Nearest square below742,032,356,569
Nearest square above742,034,079,396

Powers & multiples

742,032,356,569 to the power 2550,612,018,195,343,557,451,761
742,032,356,569 to the power 3408,571,933,416,703,886,518,502,055,368,968,009
742,032,356,569 to the power 4303173594581149344781785229165… (48 digits)
742,032,356,569 to the power 5224964616836544856812958376664… (60 digits)
First ten multiples742,032,356,569, 1,484,064,713,138, 2,226,097,069,707, 2,968,129,426,276, 3,710,161,782,845, 4,452,194,139,414, 5,194,226,495,983, 5,936,258,852,552, 6,678,291,209,121, 7,420,323,565,690
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1399the total stopping time
Highest value reached2,504,359,203,4243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps742,032,356,569 → 2,226,097,069,708 → 1,113,048,534,854 → 556,524,267,427 → 1,669,572,802,282 → 834,786,401,141 → 2,504,359,203,424 → 1,252,179,601,712 → 626,089,800,856 → 313,044,900,428 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage74,203,235,656,900%
742,032,356,569% as a decimal7,420,323,565.69
742,032,356,569% of 100742,032,356,569
742,032,356,569% of 1,0007,420,323,565,690
As a fraction of 100742,032,356,569/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

742032356569 (identifier)

  • 12 characters
  • Checksum fails

742032356569 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). No check digit validates. 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 does not matchGS1 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 “742032356569” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.