Nerdulator> put something in

Recognised as Number

4,762,913

  • Positive
  • Odd
  • Prime
  • 7 digits

4,762,913 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,762,913
Digit count7
Digit sum32
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,762,913
Distinct prime factors14,762,913
Number of divisors2
Sum of divisors σ(n)4,762,914
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,762,912integers below n that share no factor with it
Carmichael function λ(n)4,762,912the 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, 4,762,9132 in total

Arithmetic

Previous number4,762,912
Next number4,762,914
Double9,525,826
Cube108,048,301,965,043,782,497
Square root2,182.409906502≈irrational, shown to 9 decimal places
Cube root168.25095949≈
Negation-4,762,913
Reciprocal2.09955546 × 10^-7≈

Representations

Decimal4,762,913
Binary1001000101011010010000123 bits
Octal22126441
Hexadecimal48AD21
Base 362U335
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and sixty-two thousand, nine hundred and thirteen
Ordinalfour million, seven hundred and sixty-two thousand, nine hundred and thirteenth
Scientific notation4.762913 × 10^6
Engineering notation4.762913 × 10^6

In other bases

Ternary22221222111012base 3; the most digit-efficient integer base after e: 14 digits
Quinary2204403123base 5; one hand: 10 digits
Septenary55325021base 7: 8 digits
Nonary8858435base 9; each digit is two ternary digits: 7 digits
Duodecimal1718395base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19f75dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:3:1:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10000T00T1111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110011111110101100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010010001010110100100001
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; 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
Bytes348 ad 21
Gray code11011001111101110110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010010001010110100100001
64-bit0000000000000000000000000000000000000000010010001010110100100001
One's complement11111111101101110101001011011110at 32 bits, every bit flipped
Bits reversed10000100101101010001001000000000at 32 bits
Rotated left by 100000000100100010101101001000010at 32 bits, wrapping
Shifted left by 1100100010101101001000010= 9,525,826, no wrap
Shifted right by 11001000101011010010000= 2,381,456, discarding the low bit
These bits as a double2.35319169 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,762,943+30
Previous prime4,762,889−24
Distance to nearest prime0, it is prime
Nearest square below4,761,124
Nearest square above4,765,489

Powers & multiples

4,762,913 to the power 222,685,340,245,569
4,762,913 to the power 3108,048,301,965,043,782,497
4,762,913 to the power 4514,624,662,057,232,577,224,133,761
4,762,913 to the power 52,451,112,493,032,999,786,084,330,604,005,793
First ten multiples4,762,913, 9,525,826, 14,288,739, 19,051,652, 23,814,565, 28,577,478, 33,340,391, 38,103,304, 42,866,217, 47,629,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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1193the total stopping time
Highest value reached14,288,7403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,762,913 → 14,288,740 → 7,144,370 → 3,572,185 → 10,716,556 → 5,358,278 → 2,679,139 → 8,037,418 → 4,018,709 → 12,056,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage476,291,300%
4,762,913% as a decimal47,629.13
4,762,913% of 1004,762,913
4,762,913% of 1,00047,629,130
As a fraction of 1004,762,913/100

Read another way

As bytes4.542 MiB
As a 24-bit colour#48AD21

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