Base | Representation |
---|---|
bin | 1110111111100000010… |
… | …10100101000010101111 |
3 | 1211020122022202100020202 |
4 | 13133300022211002233 |
5 | 31414441341210411 |
6 | 1032351520304115 |
7 | 52134261160310 |
oct | 7376012450257 |
9 | 1736568670222 |
10 | 515130413231 |
11 | 189513763945 |
12 | 83a0417203b |
13 | 397659c8705 |
14 | 1ad0a8b4607 |
15 | d5ee10883b |
hex | 77f02a50af |
515130413231 has 4 divisors (see below), whose sum is σ = 588720472272. Its totient is φ = 441540354192.
The previous prime is 515130413207. The next prime is 515130413269. The reversal of 515130413231 is 132314031515.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 515130413231 - 26 = 515130413167 is a prime.
It is a super-2 number, since 2×5151304132312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 515130413194 and 515130413203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (515430413231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36795029510 + ... + 36795029523.
It is an arithmetic number, because the mean of its divisors is an integer number (147180118068).
Almost surely, 2515130413231 is an apocalyptic number.
515130413231 is a deficient number, since it is larger than the sum of its proper divisors (73590059041).
515130413231 is an equidigital number, since it uses as much as digits as its factorization.
515130413231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73590059040.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 515130413231 its reverse (132314031515), we get a palindrome (647444444746).
The spelling of 515130413231 in words is "five hundred fifteen billion, one hundred thirty million, four hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •