Base | Representation |
---|---|
bin | 100111001100100… |
… | …1101000101000111 |
3 | 10101122211121102002 |
4 | 1032121031011013 |
5 | 10143144330043 |
6 | 334301535515 |
7 | 44410161602 |
oct | 11631150507 |
9 | 3348747362 |
10 | 1315230023 |
11 | 61545a868 |
12 | 30857459b |
13 | 17c63b223 |
14 | c6967339 |
15 | 7a6ecbb8 |
hex | 4e64d147 |
1315230023 has 4 divisors (see below), whose sum is σ = 1315374888. Its totient is φ = 1315085160.
The previous prime is 1315230019. The next prime is 1315230047. The reversal of 1315230023 is 3200325131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3200325131 = 29 ⋅110356039.
It is a cyclic number.
It is not a de Polignac number, because 1315230023 - 22 = 1315230019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1315229977 and 1315230004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1315230013) 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, 57833 + ... + 77298.
It is an arithmetic number, because the mean of its divisors is an integer number (328843722).
Almost surely, 21315230023 is an apocalyptic number.
1315230023 is a deficient number, since it is larger than the sum of its proper divisors (144865).
1315230023 is an equidigital number, since it uses as much as digits as its factorization.
1315230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144864.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 1315230023 is about 36266.1001901225. The cubic root of 1315230023 is about 1095.6383822960.
Adding to 1315230023 its reverse (3200325131), we get a palindrome (4515555154).
The spelling of 1315230023 in words is "one billion, three hundred fifteen million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •