Base | Representation |
---|---|
bin | 10011001100110011… |
… | …01001101001000000 |
3 | 222121101012100020101 |
4 | 21212121221221000 |
5 | 132102312403114 |
6 | 4422502452144 |
7 | 513304000000 |
oct | 114631515100 |
9 | 28541170211 |
10 | 10307934784 |
11 | 440a618a74 |
12 | 1bb8134054 |
13 | c83735ac4 |
14 | 6db000000 |
15 | 404e37d74 |
hex | 266669a40 |
10307934784 has 147 divisors (see below), whose sum is σ = 24526316073. Its totient is φ = 4298289408.
The previous prime is 10307934761. The next prime is 10307934799. The reversal of 10307934784 is 48743970301.
The square root of 10307934784 is 101528.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9223681600 + 1084253184 = 96040^2 + 32928^2 .
It is a super-2 number, since 2×103079347842 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 278592814 + ... + 278592850.
Almost surely, 210307934784 is an apocalyptic number.
10307934784 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10307934784 is the 101528-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10307934784
10307934784 is an abundant number, since it is smaller than the sum of its proper divisors (14218381289).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10307934784 is an frugal number, since it uses more digits than its factorization.
10307934784 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128 (or 46 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 46.
The spelling of 10307934784 in words is "ten billion, three hundred seven million, nine hundred thirty-four thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •