Base | Representation |
---|---|
bin | 101010011110110… |
… | …0000100001100001 |
3 | 10200100011100010100 |
4 | 1110331200201201 |
5 | 10404401111040 |
6 | 353235253013 |
7 | 50215533465 |
oct | 12475404141 |
9 | 3610140110 |
10 | 1425410145 |
11 | 671674815 |
12 | 33944a169 |
13 | 199407573 |
14 | d74484a5 |
15 | 85213b30 |
hex | 54f60861 |
1425410145 has 48 divisors (see below), whose sum is σ = 2497736592. Its totient is φ = 751956480.
The previous prime is 1425410069. The next prime is 1425410159. The reversal of 1425410145 is 5410145241.
It can be written as a sum of positive squares in 8 ways, for example, as 30835809 + 1394574336 = 5553^2 + 37344^2 .
It is not a de Polignac number, because 1425410145 - 29 = 1425409633 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2156115 + ... + 2156775.
It is an arithmetic number, because the mean of its divisors is an integer number (52036179).
Almost surely, 21425410145 is an apocalyptic number.
1425410145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1425410145 is a deficient number, since it is larger than the sum of its proper divisors (1072326447).
1425410145 is a wasteful number, since it uses less digits than its factorization.
1425410145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122 (or 1119 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 1425410145 is about 37754.6042887487. The cubic root of 1425410145 is about 1125.4165094801.
Adding to 1425410145 its reverse (5410145241), we get a palindrome (6835555386).
The spelling of 1425410145 in words is "one billion, four hundred twenty-five million, four hundred ten thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •