Base | Representation |
---|---|
bin | 101010100111110… |
… | …0100100011100101 |
3 | 10200200001220110201 |
4 | 1111033210203211 |
5 | 10412104122003 |
6 | 353524550501 |
7 | 50304014455 |
oct | 12517444345 |
9 | 3620056421 |
10 | 1430145253 |
11 | 674309329 |
12 | 33ab52431 |
13 | 19a3a48c4 |
14 | d7d1bd65 |
15 | 8584bb1d |
hex | 553e48e5 |
1430145253 has 4 divisors (see below), whose sum is σ = 1430263008. Its totient is φ = 1430027500.
The previous prime is 1430145251. The next prime is 1430145287. The reversal of 1430145253 is 3525410341.
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.
It is a cyclic number.
It is not a de Polignac number, because 1430145253 - 21 = 1430145251 is a prime.
It is a super-3 number, since 3×14301452533 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430145251) 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, 38251 + ... + 65752.
It is an arithmetic number, because the mean of its divisors is an integer number (357565752).
Almost surely, 21430145253 is an apocalyptic number.
It is an amenable number.
1430145253 is a deficient number, since it is larger than the sum of its proper divisors (117755).
1430145253 is a wasteful number, since it uses less digits than its factorization.
1430145253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117754.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 1430145253 is about 37817.2613101478. The cubic root of 1430145253 is about 1126.6613158229.
Adding to 1430145253 its reverse (3525410341), we get a palindrome (4955555594).
The spelling of 1430145253 in words is "one billion, four hundred thirty million, one hundred forty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •