Base | Representation |
---|---|
bin | 1111100100111… |
… | …01100111001000 |
3 | 100002212200011121 |
4 | 13302131213020 |
5 | 231422402000 |
6 | 20544405024 |
7 | 3144445120 |
oct | 762354710 |
9 | 302780147 |
10 | 130669000 |
11 | 67839610 |
12 | 37916774 |
13 | 210c1147 |
14 | 134d5c80 |
15 | b711b1a |
hex | 7c9d9c8 |
130669000 has 128 divisors (see below), whose sum is σ = 381438720. Its totient is φ = 40704000.
The previous prime is 130668973. The next prime is 130669031. The reversal of 130669000 is 966031.
It is a super-2 number, since 2×1306690002 = 34148775122000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76152 + ... + 77848.
It is an arithmetic number, because the mean of its divisors is an integer number (2979990).
Almost surely, 2130669000 is an apocalyptic number.
130669000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130669000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190719360).
130669000 is an abundant number, since it is smaller than the sum of its proper divisors (250769720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130669000 is a wasteful number, since it uses less digits than its factorization.
130669000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1736 (or 1722 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
The square root of 130669000 is about 11431.0541946052. The cubic root of 130669000 is about 507.4471945511.
The spelling of 130669000 in words is "one hundred thirty million, six hundred sixty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •