Base | Representation |
---|---|
bin | 1101011001010011010… |
… | …1011110001101000000 |
3 | 211000000011210010022220 |
4 | 3112110311132031000 |
5 | 12232301324441000 |
6 | 253415335131040 |
7 | 22424562243141 |
oct | 3262465361500 |
9 | 730004703286 |
10 | 230130312000 |
11 | 8966361a5a6 |
12 | 38726213a80 |
13 | 189166aba64 |
14 | b1d196bac8 |
15 | 5ebd73e1a0 |
hex | 3594d5e340 |
230130312000 has 448 divisors, whose sum is σ = 797336317440. Its totient is φ = 58404864000.
The previous prime is 230130311989. The next prime is 230130312001. The reversal of 230130312000 is 213031032.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230130312001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 49413672 + ... + 49418328.
Almost surely, 2230130312000 is an apocalyptic number.
230130312000 is a gapful number since it is divisible by the number (20) 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 230130312000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (398668158720).
230130312000 is an abundant number, since it is smaller than the sum of its proper divisors (567206005440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230130312000 is a wasteful number, since it uses less digits than its factorization.
230130312000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4787 (or 4767 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 230130312000 its reverse (213031032), we get a palindrome (230343343032).
The spelling of 230130312000 in words is "two hundred thirty billion, one hundred thirty million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •