Base | Representation |
---|---|
bin | 100110101111110… |
… | …1010000100100111 |
3 | 10100121110011212011 |
4 | 1031133222010213 |
5 | 10130314110143 |
6 | 333002335051 |
7 | 44135021344 |
oct | 11537520447 |
9 | 3317404764 |
10 | 1300144423 |
11 | 607996826 |
12 | 3034ba487 |
13 | 179488936 |
14 | c495b7cb |
15 | 7921ce9d |
hex | 4d7ea127 |
1300144423 has 8 divisors (see below), whose sum is σ = 1330973840. Its totient is φ = 1269622080.
The previous prime is 1300144421. The next prime is 1300144441. The reversal of 1300144423 is 3244410031.
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 1300144423 - 21 = 1300144421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1300144394 and 1300144403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300144421) 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 7 ways as a sum of consecutive naturals, for example, 68190 + ... + 85147.
It is an arithmetic number, because the mean of its divisors is an integer number (166371730).
Almost surely, 21300144423 is an apocalyptic number.
1300144423 is a deficient number, since it is larger than the sum of its proper divisors (30829417).
1300144423 is a wasteful number, since it uses less digits than its factorization.
1300144423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153537.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1300144423 is about 36057.5154856793. The cubic root of 1300144423 is about 1091.4332975221.
Adding to 1300144423 its reverse (3244410031), we get a palindrome (4544554454).
The spelling of 1300144423 in words is "one billion, three hundred million, one hundred forty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •