Nerdulator> put something in

Recognised as Number

5,541,013

  • Positive
  • Odd
  • Prime
  • 7 digits

5,541,013 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,541,013
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5,541,013
Distinct prime factors15,541,013
Number of divisors2
Sum of divisors σ(n)5,541,014
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,541,012integers below n that share no factor with it
Carmichael function λ(n)5,541,012the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5,541,0132 in total

Arithmetic

Previous number5,541,012
Next number5,541,014
Cube170,124,752,828,368,289,197
Square root2,353.935640582≈irrational, shown to 9 decimal places
Cube root176.955088779≈
Negation-5,541,013
Reciprocal1.80472415 × 10^-7≈

Representations

Decimal5,541,013
Binary1010100100011001001010123 bits
Octal25106225
Hexadecimal548C95
Base 363ARH1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and forty-one thousand and thirteen
Ordinalfive million, five hundred and forty-one thousand and thirteenth
Scientific notation5.541013 × 10^6
Engineering notation5.541013 × 10^6

In other bases

Ternary101102111211201base 3; the most digit-efficient integer base after e: 15 digits
Quinary2404303023base 5; one hand: 10 digits
Septenary65045362base 7: 8 digits
Nonary11374751base 9; each digit is two ternary digits: 8 digits
Duodecimal1a32731base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1eccadbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:39:10:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101110TTT0TTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101011001110110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010101001000110010010101
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes354 8c 95
Gray code11111101100101011011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010101001000110010010101
64-bit0000000000000000000000000000000000000000010101001000110010010101
One's complement11111111101010110111001101101010at 32 bits, every bit flipped
Bits reversed10101001001100010010101000000000at 32 bits
Rotated left by 100000000101010010001100100101010at 32 bits, wrapping
Shifted left by 1101010010001100100101010= 11,082,026, no wrap
Shifted right by 11010100100011001001010= 2,770,506, discarding the low bit
These bits as a double2.73762417 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,541,037+24
Previous prime5,540,993−20
Distance to nearest prime0, it is prime
Nearest square below5,536,609
Nearest square above5,541,316

Powers & multiples

5,541,013 to the power 230,702,825,066,169
5,541,013 to the power 3170,124,752,828,368,289,197
5,541,013 to the power 4942,663,467,043,775,459,228,336,561
5,541,013 to the power 55,223,310,525,514,631,388,665,182,852,876,293
First ten multiples5,541,013, 11,082,026, 16,623,039, 22,164,052, 27,705,065, 33,246,078, 38,787,091, 44,328,104, 49,869,117, 55,410,130
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1170the total stopping time
Highest value reached16,623,0403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,541,013 → 16,623,040 → 8,311,520 → 4,155,760 → 2,077,880 → 1,038,940 → 519,470 → 259,735 → 779,206 → 389,603 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage554,101,300%
5,541,013% as a decimal55,410.13
5,541,013% of 1005,541,013
5,541,013% of 1,00055,410,130
As a fraction of 1005,541,013/100

Read another way

As bytes5.284 MiB
As a 24-bit colour#548C95

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “5541013” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.