Base | Representation |
---|---|
bin | 1000000110100111… |
… | …11001111000100000 |
3 | 102020012021011001200 |
4 | 10003103321320200 |
5 | 32402213014033 |
6 | 1555410401200 |
7 | 212544532233 |
oct | 40323717040 |
9 | 12205234050 |
10 | 4350516768 |
11 | 1932831704 |
12 | a14b90200 |
13 | 544428ba0 |
14 | 2d3b1741a |
15 | 1a6e12013 |
hex | 1034f9e20 |
4350516768 has 72 divisors (see below), whose sum is σ = 13323469068. Its totient is φ = 1338619392.
The previous prime is 4350516763. The next prime is 4350516791. The reversal of 4350516768 is 8676150534.
It can be written as a sum of positive squares in 2 ways, for example, as 4244261904 + 106254864 = 65148^2 + 10308^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×43505167682 = 37853992297298331648, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4350516763) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 577255 + ... + 584742.
Almost surely, 24350516768 is an apocalyptic number.
4350516768 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4350516768 is an abundant number, since it is smaller than the sum of its proper divisors (8972952300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4350516768 is a wasteful number, since it uses less digits than its factorization.
4350516768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1162026 (or 1162015 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The square root of 4350516768 is about 65958.4472831191. The cubic root of 4350516768 is about 1632.4765404801.
The spelling of 4350516768 in words is "four billion, three hundred fifty million, five hundred sixteen thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •