Base | Representation |
---|---|
bin | 1010010000101000111… |
… | …00000100111111001010 |
3 | 1020200221102210211212210 |
4 | 11020110130010333022 |
5 | 21233440214114200 |
6 | 425541122045550 |
7 | 34320012311565 |
oct | 5102434047712 |
9 | 1220842724783 |
10 | 352530223050 |
11 | 126564136385 |
12 | 583a57a98b6 |
13 | 27321b50425 |
14 | 130c390d4dc |
15 | 928424e650 |
hex | 5214704fca |
352530223050 has 48 divisors (see below), whose sum is σ = 874383535872. Its totient is φ = 93996384000.
The previous prime is 352530223033. The next prime is 352530223057. The reversal of 352530223050 is 50322035253.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 352530222999 and 352530223017.
It is not an unprimeable number, because it can be changed into a prime (352530223057) 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 23 ways as a sum of consecutive naturals, for example, 1101250 + ... + 1384850.
It is an arithmetic number, because the mean of its divisors is an integer number (18216323664).
Almost surely, 2352530223050 is an apocalyptic number.
352530223050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
352530223050 is an abundant number, since it is smaller than the sum of its proper divisors (521853312822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
352530223050 is a wasteful number, since it uses less digits than its factorization.
352530223050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291903 (or 291898 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 30.
The spelling of 352530223050 in words is "three hundred fifty-two billion, five hundred thirty million, two hundred twenty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •