Base | Representation |
---|---|
bin | 10011111110110… |
… | …011010011111000 |
3 | 212100210110101100 |
4 | 103332303103320 |
5 | 1141304331300 |
6 | 53133051400 |
7 | 11210260344 |
oct | 2376632370 |
9 | 770713340 |
10 | 335230200 |
11 | 162257458 |
12 | 94326b60 |
13 | 545b4586 |
14 | 32744624 |
15 | 1e66c700 |
hex | 13fb34f8 |
335230200 has 72 divisors (see below), whose sum is σ = 1125820800. Its totient is φ = 89394240.
The previous prime is 335230177. The next prime is 335230213. The reversal of 335230200 is 2032533.
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×3352302002 = 224758573984080000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 91320 + ... + 94919.
It is an arithmetic number, because the mean of its divisors is an integer number (15636400).
Almost surely, 2335230200 is an apocalyptic number.
335230200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
335230200 is an abundant number, since it is smaller than the sum of its proper divisors (790590600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
335230200 is a wasteful number, since it uses less digits than its factorization.
335230200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186261 (or 186249 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 18.
The square root of 335230200 is about 18309.2927225494. The cubic root of 335230200 is about 694.6740013118.
Adding to 335230200 its reverse (2032533), we get a palindrome (337262733).
The spelling of 335230200 in words is "three hundred thirty-five million, two hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •