Base | Representation |
---|---|
bin | 100110111011111… |
… | …0000010011011001 |
3 | 10101001100010010022 |
4 | 1031313300103121 |
5 | 10133423231101 |
6 | 333350000225 |
7 | 44242511240 |
oct | 11567602331 |
9 | 3331303108 |
10 | 1306461401 |
11 | 610510873 |
12 | 305646075 |
13 | 17a88acab |
14 | c5723957 |
15 | 79a69a1b |
hex | 4ddf04d9 |
1306461401 has 4 divisors (see below), whose sum is σ = 1493098752. Its totient is φ = 1119824052.
The previous prime is 1306461347. The next prime is 1306461421. The reversal of 1306461401 is 1041646031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1041646031 = 8317 ⋅125243.
It is a cyclic number.
It is not a de Polignac number, because 1306461401 - 214 = 1306445017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1306461421) 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, 93318665 + ... + 93318678.
It is an arithmetic number, because the mean of its divisors is an integer number (373274688).
Almost surely, 21306461401 is an apocalyptic number.
It is an amenable number.
1306461401 is a deficient number, since it is larger than the sum of its proper divisors (186637351).
1306461401 is an equidigital number, since it uses as much as digits as its factorization.
1306461401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186637350.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 1306461401 is about 36145.0052012723. The cubic root of 1306461401 is about 1093.1980819850.
The spelling of 1306461401 in words is "one billion, three hundred six million, four hundred sixty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •