Base | Representation |
---|---|
bin | 101001111000000… |
… | …0111010000000100 |
3 | 10121220222120101112 |
4 | 1103300013100010 |
5 | 10334202342130 |
6 | 351232344152 |
7 | 46551223154 |
oct | 12360072004 |
9 | 3556876345 |
10 | 1405121540 |
11 | 661177679 |
12 | 3326a5058 |
13 | 195152984 |
14 | d4886764 |
15 | 83557495 |
hex | 53c07404 |
1405121540 has 12 divisors (see below), whose sum is σ = 2950755276. Its totient is φ = 562048608.
The previous prime is 1405121513. The next prime is 1405121561. The reversal of 1405121540 is 451215041.
It can be written as a sum of positive squares in 2 ways, for example, as 917241796 + 487879744 = 30286^2 + 22088^2 .
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 3 ways as a sum of consecutive naturals, for example, 35128019 + ... + 35128058.
It is an arithmetic number, because the mean of its divisors is an integer number (245896273).
Almost surely, 21405121540 is an apocalyptic number.
1405121540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1405121540 is an abundant number, since it is smaller than the sum of its proper divisors (1545633736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1405121540 is a wasteful number, since it uses less digits than its factorization.
1405121540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70256086 (or 70256084 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 23.
The square root of 1405121540 is about 37484.9508469732. The cubic root of 1405121540 is about 1120.0514272729.
Adding to 1405121540 its reverse (451215041), we get a palindrome (1856336581).
The spelling of 1405121540 in words is "one billion, four hundred five million, one hundred twenty-one thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •