Base | Representation |
---|---|
bin | 101010100111100… |
… | …1011000010000100 |
3 | 10200122212121001200 |
4 | 1111033023002010 |
5 | 10412042300313 |
6 | 353522422500 |
7 | 50303100615 |
oct | 12517130204 |
9 | 3618777050 |
10 | 1430040708 |
11 | 674247828 |
12 | 33ab01a30 |
13 | 19a369145 |
14 | d7cd1c0c |
15 | 8582ab73 |
hex | 553cb084 |
1430040708 has 18 divisors (see below), whose sum is σ = 3614825214. Its totient is φ = 476680224.
The previous prime is 1430040679. The next prime is 1430040743. The reversal of 1430040708 is 8070400341.
It can be written as a sum of positive squares in only one way, i.e., 1418426244 + 11614464 = 37662^2 + 3408^2 .
It is a tau number, because it is divible by the number of its divisors (18).
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 5 ways as a sum of consecutive naturals, for example, 19861641 + ... + 19861712.
It is an arithmetic number, because the mean of its divisors is an integer number (200823623).
Almost surely, 21430040708 is an apocalyptic number.
1430040708 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1430040708 is an abundant number, since it is smaller than the sum of its proper divisors (2184784506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1430040708 is a wasteful number, since it uses less digits than its factorization.
1430040708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39723363 (or 39723358 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 1430040708 is about 37815.8790457131. The cubic root of 1430040708 is about 1126.6338618103.
The spelling of 1430040708 in words is "one billion, four hundred thirty million, forty thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •