Base | Representation |
---|---|
bin | 100110111001010… |
… | …0100001011011111 |
3 | 10100221210000000221 |
4 | 1031302210023133 |
5 | 10133101213043 |
6 | 333300502211 |
7 | 44225114152 |
oct | 11562441337 |
9 | 3327700027 |
10 | 1305101023 |
11 | 60a771796 |
12 | 3050aa967 |
13 | 17a502a35 |
14 | c548bc99 |
15 | 7989b8ed |
hex | 4dca42df |
1305101023 has 4 divisors (see below), whose sum is σ = 1347201088. Its totient is φ = 1263000960.
The previous prime is 1305101009. The next prime is 1305101027. The reversal of 1305101023 is 3201015031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1305101023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1305100988 and 1305101006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1305101027) 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 3 ways as a sum of consecutive naturals, for example, 21049986 + ... + 21050047.
It is an arithmetic number, because the mean of its divisors is an integer number (336800272).
Almost surely, 21305101023 is an apocalyptic number.
1305101023 is a deficient number, since it is larger than the sum of its proper divisors (42100065).
1305101023 is an equidigital number, since it uses as much as digits as its factorization.
1305101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42100064.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1305101023 is about 36126.1819599027. The cubic root of 1305101023 is about 1092.8185123840.
Adding to 1305101023 its reverse (3201015031), we get a palindrome (4506116054).
The spelling of 1305101023 in words is "one billion, three hundred five million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •