Base | Representation |
---|---|
bin | 11110100100111… |
… | …110111010000011 |
3 | 1022202022200020200 |
4 | 132210332322003 |
5 | 2022312330311 |
6 | 122523340243 |
7 | 15466344600 |
oct | 3644767203 |
9 | 1282280220 |
10 | 513011331 |
11 | 243644008 |
12 | 123981683 |
13 | 8238c501 |
14 | 4c1c16a7 |
15 | 30088556 |
hex | 1e93ee83 |
513011331 has 36 divisors (see below), whose sum is σ = 868303800. Its totient is φ = 291005568.
The previous prime is 513011309. The next prime is 513011333. The reversal of 513011331 is 133110315.
It is not a de Polignac number, because 513011331 - 210 = 513010307 is a prime.
It is a super-3 number, since 3×5130113313 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (513011333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 57115 + ... + 65483.
It is an arithmetic number, because the mean of its divisors is an integer number (24119550).
Almost surely, 2513011331 is an apocalyptic number.
513011331 is a deficient number, since it is larger than the sum of its proper divisors (355292469).
513011331 is a wasteful number, since it uses less digits than its factorization.
513011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8528 (or 8518 counting only the distinct ones).
The product of its (nonzero) digits is 135, while the sum is 18.
The square root of 513011331 is about 22649.7534423667. The cubic root of 513011331 is about 800.5263884638.
Adding to 513011331 its reverse (133110315), we get a palindrome (646121646).
It can be divided in two parts, 5130 and 11331, that added together give a palindrome (16461).
The spelling of 513011331 in words is "five hundred thirteen million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •