Nerdulator> put something in

Recognised as Number

4,120,031,205,796

  • Positive
  • Even
  • Composite
  • Perfect square
  • 13 digits

4,120,031,205,796 is an even 13-digit integer and a composite number. It has 81 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,120,031,205,796
Digit count13
Digit sum40
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 2,029,786²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 11^2 × 257^2 × 359^2
Distinct prime factors42, 11, 257, 359
Number of divisors81
Sum of divisors σ(n)7,978,281,760,897
Aliquot sum3,858,250,555,101sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,860,258,273,280integers below n that share no factor with it
Carmichael function λ(n)232,532,284,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,860,258,273,280
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 121, 242, 257, 359, 484, 514, 718, 1,028, 1,436, 2,827, 3,949, 5,654, 7,898, 11,308, 15,796, 31,097, 43,439, 62,194, 66,049, 86,878, 92,263, 124,388, 128,881, 132,098, 173,756, 184,526, 257,762, 264,196, 369,052, 515,524, 726,539, 1,014,893, 1,417,691, 1,453,078, 2,029,786, 2,835,382, 2,906,156, 4,059,572, 5,670,764, 7,991,929, 11,163,823, 15,594,601, 15,983,858, 22,327,646, 23,711,591, 31,189,202, 31,967,716, 33,122,417, 44,655,292, 47,423,182, 62,378,404, 66,244,834, 94,846,364, 132,489,668, 260,827,501, 364,346,587, 521,655,002, 728,693,174, 1,043,310,004, 1,457,386,348, 2,869,102,511, 4,007,812,457, 5,738,205,022, 8,015,624,914, 8,512,461,169, 11,476,410,044, 16,031,249,828, 17,024,922,338, 34,049,844,676, 93,637,072,859, 187,274,145,718, 374,548,291,436, 1,030,007,801,449, 2,060,015,602,898, 4,120,031,205,79681 in total

Arithmetic

Previous number4,120,031,205,795
Square16,974,657,136,732,841,703,993,616
Cube69,936,117,111,027,086,649,618,413,037,166,198,336
Square root2,029,786exact
Cube root16,031.229637248≈
Reciprocal2.42716608 × 10^-13≈

Representations

Decimal4,120,031,205,796
Binary11101111110100010011111111000110011010010042 bits
Octal73750477614644
Hexadecimal3BF44FF19A4
Base 361GKPS7C84
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour trillion, one hundred and twenty billion, thirty-one million, two hundred and five thousand, seven hundred and ninety-six
Ordinalfour trillion, one hundred and twenty billion, thirty-one million, two hundred and five thousand, seven hundred and ninety-sixth
Scientific notation4.12003121 × 10^12
Engineering notation4.120031 × 10^12

In other bases

Ternary112120212112001120201201211base 3; the most digit-efficient integer base after e: 27 digits
Quinary1020000310442041141base 5; one hand: 19 digits
Septenary603443133265402base 7: 15 digits
Nonary15525461521654base 9; each digit is two ternary digits: 14 digits
Duodecimal5665a6146204base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal80if9f0e9gbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:28:18:23:38:32:43:16base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT0TT10T0TTT01TTT1T1TT1TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001100001101000101000000110110111011100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000000111011111101000100111111110001100110100100
Bit length42 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits17within that length
Bit parityodd25 set bits, so odd; not the same as the number itself being even
Highest set bitbit 41worth 2,199,023,255,552
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes603 bf 44 ff 19 a4
Gray code100110000011100110100000001001010101110110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000000111011111101000100111111110001100110100100
One's complement1111111111111111111111000100000010111011000000001110011001011011at 64 bits, every bit flipped
Bits reversed0010010110011000111111110010001011111101110000000000000000000000at 64 bits
Rotated left by 10000000000000000000001110111111010001001111111100011001101001000at 64 bits, wrapping
Shifted left by 11110111111010001001111111100011001101001000= 8,240,062,411,592, no wrap
Shifted right by 111101111110100010011111111000110011010010= 2,060,015,602,898, discarding the low bit
These bits as a double2.03556588 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,120,031,205,809+13
Previous prime4,120,031,205,727−69
Distance to nearest prime13
Nearest square below4,120,031,205,796
Nearest square above4,120,035,265,369

Powers & multiples

4,120,031,205,796 to the power 216,974,657,136,732,841,703,993,616
4,120,031,205,796 to the power 369,936,117,111,027,086,649,618,413,037,166,198,336
4,120,031,205,796 to the power 4288138984909635195817044324028… (51 digits)
4,120,031,205,796 to the power 5118714160943407974392057770173… (64 digits)
First ten multiples4,120,031,205,796, 8,240,062,411,592, 12,360,093,617,388, 16,480,124,823,184, 20,600,156,028,980, 24,720,187,234,776, 28,840,218,440,572, 32,960,249,646,368, 37,080,280,852,164, 41,200,312,057,960
Powers of twoBetween 2^41 (2,199,023,255,552) and 2^42 (4,398,046,511,104)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1417the total stopping time
Highest value reached7,821,621,742,2641× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,120,031,205,796 → 2,060,015,602,898 → 1,030,007,801,449 → 3,090,023,404,348 → 1,545,011,702,174 → 772,505,851,087 → 2,317,517,553,262 → 1,158,758,776,631 → 3,476,276,329,894 → 1,738,138,164,947 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage412,003,120,579,600%
4,120,031,205,796% as a decimal41,200,312,057.96
4,120,031,205,796% of 1004,120,031,205,796
4,120,031,205,796% of 1,00041,200,312,057,960
As a fraction of 1004,120,031,205,796/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

4120031205796 (identifier)

  • 13 characters
  • Checksum valid

4120031205796 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). The check digit is valid for ISBN-13 / EAN-13. 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

ISBN-13 / EAN-13Check digit validmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled

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 “4120031205796” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.