Base | Representation |
---|---|
bin | 10110001000010110110… |
… | …00000011000010110010 |
3 | 2200200201120212121001220 |
4 | 23010023120003002302 |
5 | 44424244404032230 |
6 | 1341153432205510 |
7 | 105636264622410 |
oct | 13041330030262 |
9 | 2620646777056 |
10 | 760400064690 |
11 | 273536016232 |
12 | 103454539896 |
13 | 56922a5bca6 |
14 | 28b36d782b0 |
15 | 14ba69d2d10 |
hex | b10b6030b2 |
760400064690 has 128 divisors (see below), whose sum is σ = 2209470939648. Its totient is φ = 163499212800.
The previous prime is 760400064689. The next prime is 760400064709. The reversal of 760400064690 is 96460004067.
It is a super-2 number, since 2×7604000646902 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7147890 + ... + 7253490.
It is an arithmetic number, because the mean of its divisors is an integer number (17261491716).
Almost surely, 2760400064690 is an apocalyptic number.
760400064690 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 760400064690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1104735469824).
760400064690 is an abundant number, since it is smaller than the sum of its proper divisors (1449070874958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
760400064690 is a wasteful number, since it uses less digits than its factorization.
760400064690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107652.
The product of its (nonzero) digits is 217728, while the sum is 42.
The spelling of 760400064690 in words is "seven hundred sixty billion, four hundred million, sixty-four thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •