Base | Representation |
---|---|
bin | 100110111001001… |
… | …0001001110101001 |
3 | 10100221122001120001 |
4 | 1031302101032221 |
5 | 10133041222101 |
6 | 333255103001 |
7 | 44224341643 |
oct | 11562211651 |
9 | 3327561501 |
10 | 1305023401 |
11 | 60a719440 |
12 | 305071a61 |
13 | 17a4a65c6 |
14 | c546b893 |
15 | 79883901 |
hex | 4dc913a9 |
1305023401 has 8 divisors (see below), whose sum is σ = 1427890464. Its totient is φ = 1182861120.
The previous prime is 1305023371. The next prime is 1305023413. The reversal of 1305023401 is 1043205031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1305023401 - 29 = 1305022889 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1305023501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 172315 + ... + 179728.
It is an arithmetic number, because the mean of its divisors is an integer number (178486308).
Almost surely, 21305023401 is an apocalyptic number.
1305023401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1305023401 is a deficient number, since it is larger than the sum of its proper divisors (122867063).
1305023401 is a wasteful number, since it uses less digits than its factorization.
1305023401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352391.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 1305023401 is about 36125.1076261373. The cubic root of 1305023401 is about 1092.7968465158.
Adding to 1305023401 its reverse (1043205031), we get a palindrome (2348228432).
It can be divided in two parts, 130502 and 3401, that added together give a triangular number (133903 = T517).
The spelling of 1305023401 in words is "one billion, three hundred five million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •