Recognised as Number
270,425,700,738
- Positive
- Even
- Composite
- 12 digits
270,425,700,738 is an even 12-digit integer and a composite number. It has 42 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value270,425,700,738
Digit count12
Digit sum45
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^6 × 13,619^2
Distinct prime factors32, 3, 13,619
Number of divisors42
Sum of divisors σ(n)608,224,270,899
Aliquot sum337,798,570,161sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)90,135,281,412integers below n that share no factor with it
Carmichael function λ(n)45,067,640,706the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 90,135,281,412
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 243, 486, 729, 1,458, 13,619, 27,238, 40,857, 81,714, 122,571, 245,142, 367,713, 735,426, 1,103,139, 2,206,278, 3,309,417, 6,618,834, 9,928,251, 19,856,502, 185,477,161, 370,954,322, 556,431,483, 1,112,862,966, 1,669,294,449, 3,338,588,898, 5,007,883,347, 10,015,766,694, 15,023,650,041, 30,047,300,082, 45,070,950,123, 90,141,900,246, 135,212,850,369, 270,425,700,73842 in total
Arithmetic
Previous number270,425,700,737
Next number270,425,700,739
Double540,851,401,476
Half135,212,850,369
Square73,130,059,619,638,333,744,644
Cube19,776,247,617,652,414,149,022,065,254,347,272
Square root520,024.711660898≈irrational, shown to 9 decimal places
Cube root6,466.699117681≈
Negation-270,425,700,738
Reciprocal3.69787338 × 10^-12≈
Representations
Decimal270,425,700,738
Binary1111101111011010100000101110011000001038 bits
Octal3736650134602
Hexadecimal3EF6A0B982
Base 363G8CHA4I
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo hundred and seventy billion, four hundred and twenty-five million, seven hundred thousand, seven hundred and thirty-eight
Ordinaltwo hundred and seventy billion, four hundred and twenty-five million, seven hundred thousand, seven hundred and thirty-eighth
Scientific notation2.70425701 × 10^11
Engineering notation270.425701 × 10^9
In other bases
Ternary221212000102122222000000base 3; the most digit-efficient integer base after e: 24 digits
Quinary13412312434410423base 5; one hand: 17 digits
Septenary25352254346454base 7: 14 digits
Nonary855012588000base 9; each digit is two ternary digits: 12 digits
Duodecimal444b102a716base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalab580cbgibase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal5:47:46:10:50:12:18base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary100T0TT000110T0000T000000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001100001011111000011100111010000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000011111011110110101000001011100110000010
Bit length38 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits18within that length
Bit parityeven20 set bits, so even; not the same as the number itself being even
Highest set bitbit 37worth 137,438,953,472
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes53e f6 a0 b9 82
Gray code10000110001101111100001110010101000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000011111011110110101000001011100110000010
One's complement1111111111111111111111111100000100001001010111110100011001111101at 64 bits, every bit flipped
Bits reversed0100000110011101000001010110111101111100000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000111110111101101010000010111001100000100at 64 bits, wrapping
Shifted left by 1111110111101101010000010111001100000100= 540,851,401,476, no wrap
Shifted right by 11111101111011010100000101110011000001= 135,212,850,369, discarding the low bit
These bits as a double1.33608048 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
270,425,700,738 to the power 273,130,059,619,638,333,744,644
270,425,700,738 to the power 319,776,247,617,652,414,149,022,065,254,347,272
270,425,700,738 to the power 4534800561997185719476667795383… (46 digits)
270,425,700,738 to the power 5144623816733165160973404583207… (58 digits)
First ten multiples270,425,700,738, 540,851,401,476, 811,277,102,214, 1,081,702,802,952, 1,352,128,503,690, 1,622,554,204,428, 1,892,979,905,166, 2,163,405,605,904, 2,433,831,306,642, 2,704,257,007,380
Powers of twoBetween 2^37 (137,438,953,472) and 2^38 (274,877,906,944)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1245the total stopping time
Highest value reached405,638,551,1081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps270,425,700,738 → 135,212,850,369 → 405,638,551,108 → 202,819,275,554 → 101,409,637,777 → 304,228,913,332 → 152,114,456,666 → 76,057,228,333 → 228,171,685,000 → 114,085,842,500 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage27,042,570,073,800%
270,425,700,738% as a decimal2,704,257,007.38
270,425,700,738% of 100270,425,700,738
270,425,700,738% of 1,0002,704,257,007,380
As a fraction of 100270,425,700,738/100
Read another way
As seconds8,569 years, 99 days and 20 hours
As bytes251.854 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 270,425,700,738
Nearby primes
Also reads as
270425700738 (identifier)
- 12 characters
- Checksum valid
270425700738 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for Luhn (cards, IMEI). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit validmod 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