Base | Representation |
---|---|
bin | 101011010000000… |
… | …0001100011010100 |
3 | 10202010202101220110 |
4 | 1112200001203110 |
5 | 10433004014130 |
6 | 400001003020 |
7 | 50651204256 |
oct | 12640014324 |
9 | 3663671813 |
10 | 1451235540 |
11 | 685203817 |
12 | 346023470 |
13 | 1a187a371 |
14 | daa4bcd6 |
15 | 87615ab0 |
hex | 568018d4 |
1451235540 has 24 divisors (see below), whose sum is σ = 4063459680. Its totient is φ = 386996128.
The previous prime is 1451235521. The next prime is 1451235551. The reversal of 1451235540 is 455321541.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1451235498 and 1451235507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12093570 + ... + 12093689.
It is an arithmetic number, because the mean of its divisors is an integer number (169310820).
Almost surely, 21451235540 is an apocalyptic number.
1451235540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1451235540 is an abundant number, since it is smaller than the sum of its proper divisors (2612224140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451235540 is a wasteful number, since it uses less digits than its factorization.
1451235540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24187271 (or 24187269 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
The square root of 1451235540 is about 38095.0855098135. The cubic root of 1451235540 is about 1132.1725868619.
The spelling of 1451235540 in words is "one billion, four hundred fifty-one million, two hundred thirty-five thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •