Base | Representation |
---|---|
bin | 1000100111011110… |
… | …00010100100001000 |
3 | 102221101202111002122 |
4 | 10103233002210020 |
5 | 33433233100142 |
6 | 2043012350412 |
7 | 222431623634 |
oct | 42357024410 |
9 | 12841674078 |
10 | 4626065672 |
11 | 1a64325678 |
12 | a91315408 |
13 | 589545587 |
14 | 31c563dc4 |
15 | 1c11e11d2 |
hex | 113bc2908 |
4626065672 has 36 divisors (see below), whose sum is σ = 8787517245. Its totient is φ = 2283118368.
The previous prime is 4626065659. The next prime is 4626065683. The reversal of 4626065672 is 2765606264.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 3639226276 + 986839396 = 60326^2 + 31414^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=48094.
It is a super-3 number, since 3×46260656723 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 26740178 + ... + 26740350.
Almost surely, 24626065672 is an apocalyptic number.
It is an amenable number.
4626065672 is a deficient number, since it is larger than the sum of its proper divisors (4161451573).
4626065672 is an equidigital number, since it uses as much as digits as its factorization.
4626065672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630 (or 314 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 44.
The square root of 4626065672 is about 68015.1870687716. The cubic root of 4626065672 is about 1666.2388819607.
The spelling of 4626065672 in words is "four billion, six hundred twenty-six million, sixty-five thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •