Base | Representation |
---|---|
bin | 1010001011111100101… |
… | …01111001010111101000 |
3 | 1020110102221100212222120 |
4 | 11011332111321113220 |
5 | 21213311034121300 |
6 | 424443204151240 |
7 | 34200424040403 |
oct | 5057625712750 |
9 | 1213387325876 |
10 | 350012020200 |
11 | 12549172a2a7 |
12 | 57a02398520 |
13 | 2701021987b |
14 | 12d252c0d3a |
15 | 918812a3a0 |
hex | 517e5795e8 |
350012020200 has 96 divisors (see below), whose sum is σ = 1089360588960. Its totient is φ = 92964640000.
The previous prime is 350012020133. The next prime is 350012020207. The reversal of 350012020200 is 2020210053.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 350012020200.
It is not an unprimeable number, because it can be changed into a prime (350012020207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1011459 + ... + 1312658.
It is an arithmetic number, because the mean of its divisors is an integer number (11347506135).
Almost surely, 2350012020200 is an apocalyptic number.
350012020200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
350012020200 is an abundant number, since it is smaller than the sum of its proper divisors (739348568760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350012020200 is a wasteful number, since it uses less digits than its factorization.
350012020200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2324387 (or 2324378 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
Adding to 350012020200 its reverse (2020210053), we get a palindrome (352032230253).
The spelling of 350012020200 in words is "three hundred fifty billion, twelve million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •