Base | Representation |
---|---|
bin | 11011011111111… |
… | …01010000110100 |
3 | 121002001112022100 |
4 | 31233331100310 |
5 | 433023104013 |
6 | 34520102100 |
7 | 5500465230 |
oct | 1557752064 |
9 | 532045270 |
10 | 230675508 |
11 | 109234a18 |
12 | 65304930 |
13 | 38a378ab |
14 | 228c95c0 |
15 | 153b8473 |
hex | dbfd434 |
230675508 has 36 divisors (see below), whose sum is σ = 666396640. Its totient is φ = 65907216.
The previous prime is 230675507. The next prime is 230675563. The reversal of 230675508 is 805576032.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×2306755082 = 106422379982116128, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230675503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 457438 + ... + 457941.
Almost surely, 2230675508 is an apocalyptic number.
230675508 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
230675508 is an abundant number, since it is smaller than the sum of its proper divisors (435721132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230675508 is a wasteful number, since it uses less digits than its factorization.
230675508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915396 (or 915391 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 230675508 is about 15188.0053989983. The cubic root of 230675508 is about 613.2918055006.
The spelling of 230675508 in words is "two hundred thirty million, six hundred seventy-five thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •