Base | Representation |
---|---|
bin | 11011011101000… |
… | …01101101010000 |
3 | 121001100110220000 |
4 | 31232201231100 |
5 | 432424103441 |
6 | 34504050000 |
7 | 5464344006 |
oct | 1556415520 |
9 | 531313800 |
10 | 230300496 |
11 | 108aa9198 |
12 | 65163900 |
13 | 38935caa |
14 | 2282ca76 |
15 | 153422b6 |
hex | dba1b50 |
230300496 has 100 divisors (see below), whose sum is σ = 705833172. Its totient is φ = 72244224.
The previous prime is 230300467. The next prime is 230300533. The reversal of 230300496 is 694003032.
230300496 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 208398096 + 21902400 = 14436^2 + 4680^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 16806 + ... + 27258.
Almost surely, 2230300496 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 230300496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (352916586).
230300496 is an abundant number, since it is smaller than the sum of its proper divisors (475532676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230300496 is a wasteful number, since it uses less digits than its factorization.
230300496 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10490 (or 10475 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The square root of 230300496 is about 15175.6547140478. The cubic root of 230300496 is about 612.9592799040.
The spelling of 230300496 in words is "two hundred thirty million, three hundred thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •