Base | Representation |
---|---|
bin | 1111010011000101… |
… | …0000000000010001 |
3 | 101121012012102101002 |
4 | 3310301100000101 |
5 | 31402234120223 |
6 | 1515253351345 |
7 | 203523052544 |
oct | 36461200021 |
9 | 11535172332 |
10 | 4106551313 |
11 | 181804a867 |
12 | 967338555 |
13 | 505a1a127 |
14 | 2ad56c85b |
15 | 1907c0e28 |
hex | f4c50011 |
4106551313 has 4 divisors (see below), whose sum is σ = 4106695680. Its totient is φ = 4106406948.
The previous prime is 4106551277. The next prime is 4106551327. The reversal of 4106551313 is 3131556014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4106551313 - 26 = 4106551249 is a prime.
It is a super-3 number, since 3×41065513133 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4106551013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13745 + ... + 91662.
It is an arithmetic number, because the mean of its divisors is an integer number (1026673920).
Almost surely, 24106551313 is an apocalyptic number.
It is an amenable number.
4106551313 is a deficient number, since it is larger than the sum of its proper divisors (144367).
4106551313 is a wasteful number, since it uses less digits than its factorization.
4106551313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144366.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 4106551313 is about 64082.3791146989. The cubic root of 4106551313 is about 1601.3726908683.
The spelling of 4106551313 in words is "four billion, one hundred six million, five hundred fifty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •