Recognised as Number
501,391,448,100
- Positive
- Even
- Composite
- Perfect square
- 12 digits
501,391,448,100 is an even 12-digit integer and a composite number. It has 81 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value501,391,448,100
Digit count12
Digit sum36
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
Perfect squareYes, 708,090²
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3^2 × 5^2 × 23,603^2
Distinct prime factors42, 3, 5, 23,603
Number of divisors81
Sum of divisors σ(n)1,571,650,225,873
Aliquot sum1,070,258,777,773sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)133,698,721,440integers below n that share no factor with it
Carmichael function λ(n)16,712,340,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 133,698,721,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 25, 30, 36, 45, 50, 60, 75, 90, 100, 150, 180, 225, 300, 450, 900, 23,603, 47,206, 70,809, 94,412, 118,015, 141,618, 212,427, 236,030, 283,236, 354,045, 424,854, 472,060, 590,075, 708,090, 849,708, 1,062,135, 1,180,150, 1,416,180, 1,770,225, 2,124,270, 2,360,300, 3,540,450, 4,248,540, 5,310,675, 7,080,900, 10,621,350, 21,242,700, 557,101,609, 1,114,203,218, 1,671,304,827, 2,228,406,436, 2,785,508,045, 3,342,609,654, 5,013,914,481, 5,571,016,090, 6,685,219,308, 8,356,524,135, 10,027,828,962, 11,142,032,180, 13,927,540,225, 16,713,048,270, 20,055,657,924, 25,069,572,405, 27,855,080,450, 33,426,096,540, 41,782,620,675, 50,139,144,810, 55,710,160,900, 83,565,241,350, 100,278,289,620, 125,347,862,025, 167,130,482,700, 250,695,724,050, 501,391,448,10081 in total
Arithmetic
Previous number501,391,448,099
Next number501,391,448,101
Double1,002,782,896,200
Half250,695,724,050
Square251,393,384,227,814,993,610,000
Cube126,046,492,960,743,859,945,010,146,641,000,000
Square root708,090exact
Cube root7,944.36106117≈
Negation-501,391,448,100
Reciprocal1.99444965 × 10^-12≈
Representations
Decimal501,391,448,100
Binary11101001011110101000010010110000010010039 bits
Octal7227520454044
Hexadecimal74BD425824
Base 366EC3ITD0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive hundred and one billion, three hundred and ninety-one million, four hundred and forty-eight thousand, one hundred
Ordinalfive hundred and one billion, three hundred and ninety-one million, four hundred and forty-eight thousand, one hundredth
Scientific notation5.01391448 × 10^11
Engineering notation501.391448 × 10^9
In other bases
Ternary1202221011211110121012100base 3; the most digit-efficient integer base after e: 25 digits
Quinary31203322202314400base 5; one hand: 17 digits
Septenary51136642663344base 7: 14 digits
Nonary1687154417170base 9; each digit is two ternary digits: 13 digits
Duodecimal8120ab94030base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimaljbe4gb050base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal10:44:47:36:42:15:0base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1TT100T11TTT11111TT11TT100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010111001101010001111010100001100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000111010010111101010000100101100000100100
Bit length39 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits22within that length
Bit parityodd17 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
Bytes574 bd 42 58 24
Gray code100111011100011111000110111010000110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000111010010111101010000100101100000100100
One's complement1111111111111111111111111000101101000010101111011010011111011011at 64 bits, every bit flipped
Bits reversed0010010000011010010000101011110100101110000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001110100101111010100001001011000001001000at 64 bits, wrapping
Shifted left by 11110100101111010100001001011000001001000= 1,002,782,896,200, no wrap
Shifted right by 111101001011110101000010010110000010010= 250,695,724,050, discarding the low bit
These bits as a double2.4772029 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
501,391,448,100 to the power 2251,393,384,227,814,993,610,000
501,391,448,100 to the power 3126,046,492,960,743,859,945,010,146,641,000,000
501,391,448,100 to the power 4631986336335138203910122237935… (47 digits)
501,391,448,100 to the power 5316872544354488590972129271126… (59 digits)
First ten multiples501,391,448,100, 1,002,782,896,200, 1,504,174,344,300, 2,005,565,792,400, 2,506,957,240,500, 3,008,348,688,600, 3,509,740,136,700, 4,011,131,584,800, 4,512,523,032,900, 5,013,914,481,000
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 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1233the total stopping time
Highest value reached634,573,551,5081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps501,391,448,100 → 250,695,724,050 → 125,347,862,025 → 376,043,586,076 → 188,021,793,038 → 94,010,896,519 → 282,032,689,558 → 141,016,344,779 → 423,049,034,338 → 211,524,517,169 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage50,139,144,810,000%
501,391,448,100% as a decimal5,013,914,481
501,391,448,100% of 100501,391,448,100
501,391,448,100% of 1,0005,013,914,481,000
As a fraction of 100501,391,448,100/100
Read another way
As seconds15,888 years, 49 days and 18 hours
As bytes466.957 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 501,391,448,100
Nearby primes
Also reads as
501391448100 (identifier)
- 12 characters
- Checksum valid
501391448100 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.
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