Base | Representation |
---|---|
bin | 101000001111000… |
… | …101000000011111 |
3 | 1202001012122121001 |
4 | 220033011000133 |
5 | 2340302310221 |
6 | 150552251131 |
7 | 22504520320 |
oct | 5017050037 |
9 | 1661178531 |
10 | 675041311 |
11 | 31705258a |
12 | 16a0a0aa7 |
13 | a9b10c39 |
14 | 6591c447 |
15 | 3e3e2391 |
hex | 283c501f |
675041311 has 16 divisors (see below), whose sum is σ = 787235328. Its totient is φ = 566863200.
The previous prime is 675041303. The next prime is 675041347. The reversal of 675041311 is 113140576.
It is a cyclic number.
It is not a de Polignac number, because 675041311 - 23 = 675041303 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 675041311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (675041011) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 109296 + ... + 115306.
It is an arithmetic number, because the mean of its divisors is an integer number (49202208).
Almost surely, 2675041311 is an apocalyptic number.
675041311 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
675041311 is a deficient number, since it is larger than the sum of its proper divisors (112194017).
675041311 is a wasteful number, since it uses less digits than its factorization.
675041311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6342.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 675041311 is about 25981.5571319350. The cubic root of 675041311 is about 877.2232165205.
Adding to 675041311 its reverse (113140576), we get a palindrome (788181887).
The spelling of 675041311 in words is "six hundred seventy-five million, forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •