Recognised as Number

349,453,016,004

Positive
Even
Composite
12 digits

349,453,016,004 is an even 12-digit integer and a composite number. It has 48 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value349,453,016,004

Digit count12

Digit sum39

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 271 × 5,653 × 19,009

Distinct prime factors52, 3, 271, 5,653, 19,009

Number of divisors48

Sum of divisors σ(n)818,587,024,640

Aliquot sum469,134,008,636sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)116,027,873,280integers below n that share no factor with it

Carmichael function λ(n)14,921,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 116,027,873,280

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 271, 542, 813, 1,084, 1,626, 3,252, 5,653, 11,306, 16,959, 19,009, 22,612, 33,918, 38,018, 57,027, 67,836, 76,036, 114,054, 228,108, 1,531,963, 3,063,926, 4,595,889, 5,151,439, 6,127,852, 9,191,778, 10,302,878, 15,454,317, 18,383,556, 20,605,756, 30,908,634, 61,817,268, 107,457,877, 214,915,754, 322,373,631, 429,831,508, 644,747,262, 1,289,494,524, 29,121,084,667, 58,242,169,334, 87,363,254,001, 116,484,338,668, 174,726,508,002, 349,453,016,00448 in total

Arithmetic

Previous number349,453,016,003

Next number349,453,016,005

Double698,906,032,008

Half174,726,508,002

Square122,117,410,394,291,880,128,016

Cube42,674,297,368,883,516,336,622,824,816,768,064

Square root591,145.511700799≈irrational, shown to 9 decimal places

Cube root7,043.625618299≈

Negation-349,453,016,004

Reciprocal2.86161502 × 10^-12≈

Representations

Decimal349,453,016,004

Binary10100010101110100000101110110111100010039 bits

Octal5053501355704

Hexadecimal515D05DBC4

Base 364GJBAWUC

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

In wordsthree hundred and forty-nine billion, four hundred and fifty-three million, sixteen thousand and four

Ordinalthree hundred and forty-nine billion, four hundred and fifty-three million, sixteen thousand and fourth

Scientific notation3.49453016 × 10^11

Engineering notation349.453016 × 10^9

In other bases

Ternary1020101222222111112101110base 3; the most digit-efficient integer base after e: 25 digits

Quinary21211134433003004base 5; one hand: 17 digits

Septenary34150525424511base 7: 14 digits

Nonary1211888445343base 9; each digit is two ternary digits: 13 digits

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

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

Sexagesimal7:29:23:58:2:13:24base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000000101000101011101000001011101101111000100

Bit length39 bitsto write the magnitude

Set bits19the population count, or Hamming weight

Zero bits20within that length

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

Highest set bitbit 38worth 274,877,906,944

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes551 5d 05 db c4

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

At each machine width

64-bit0000000000000000000000000101000101011101000001011101101111000100

One's complement1111111111111111111111111010111010100010111110100010010000111011at 64 bits, every bit flipped

Bits reversed0010001111011011101000001011101010001010000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000001010001010111010000010111011011110001000at 64 bits, wrapping

Shifted left by 11010001010111010000010111011011110001000= 698,906,032,008, no wrap

Shifted right by 110100010101110100000101110110111100010= 174,726,508,002, discarding the low bit

These bits as a double1.7265273 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime349,453,016,027+23

Previous prime349,453,015,979−25

Distance to nearest prime23

Nearest square below349,452,411,025

Nearest square above349,453,593,316

Powers & multiples

349,453,016,004 to the power 2122,117,410,394,291,880,128,016

349,453,016,004 to the power 342,674,297,368,883,516,336,622,824,816,768,064

349,453,016,004 to the power 4149126619214079065259936514520… (47 digits)

349,453,016,004 to the power 5521127468508399854944019552286… (58 digits)

First ten multiples349,453,016,004, 698,906,032,008, 1,048,359,048,012, 1,397,812,064,016, 1,747,265,080,020, 2,096,718,096,024, 2,446,171,112,028, 2,795,624,128,032, 3,145,077,144,036, 3,494,530,160,040

Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 4

Divisible by 12Yes

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1279the total stopping time

Highest value reached349,453,016,004

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

First steps349,453,016,004 → 174,726,508,002 → 87,363,254,001 → 262,089,762,004 → 131,044,881,002 → 65,522,440,501 → 196,567,321,504 → 98,283,660,752 → 49,141,830,376 → 24,570,915,188 → …

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

As a percentage & fraction

As a percentage34,945,301,600,400%

349,453,016,004% as a decimal3,494,530,160.04

349,453,016,004% of 100349,453,016,004

349,453,016,004% of 1,0003,494,530,160,040

As a fraction of 100349,453,016,004/100

Read another way

As seconds11,073 years, 181 days and 20 hours

As bytes325.453 GiB

Keep nerding

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

Neighbouring numbers

Derived from 349,453,016,004

Nearby primes

349453016004 (identifier)

12 characters
Checksum fails

349453016004 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