Base | Representation |
---|---|
bin | 1101011010011011111… |
… | …0011001011001110000 |
3 | 211000210101102122221121 |
4 | 3112212332121121300 |
5 | 12233412232012040 |
6 | 253505450032024 |
7 | 22435246064206 |
oct | 3264676313160 |
9 | 730711378847 |
10 | 230434641520 |
11 | 897aa3908a6 |
12 | 387b0118614 |
13 | 189647643b5 |
14 | b22014b076 |
15 | 5eda305c4a |
hex | 35a6f99670 |
230434641520 has 80 divisors (see below), whose sum is σ = 542942928000. Its totient is φ = 90945275904.
The previous prime is 230434641499. The next prime is 230434641533. The reversal of 230434641520 is 25146434032.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2028796 + ... + 2139364.
It is an arithmetic number, because the mean of its divisors is an integer number (6786786600).
Almost surely, 2230434641520 is an apocalyptic number.
230434641520 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 230434641520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (271471464000).
230434641520 is an abundant number, since it is smaller than the sum of its proper divisors (312508286480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230434641520 is a wasteful number, since it uses less digits than its factorization.
230434641520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110930 (or 110924 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 34.
The spelling of 230434641520 in words is "two hundred thirty billion, four hundred thirty-four million, six hundred forty-one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •