Base | Representation |
---|---|
bin | 1001100110101011000… |
… | …10001011001000101010 |
3 | 1011112210021020221120100 |
4 | 10303111202023020222 |
5 | 20401320001120020 |
6 | 411333325410230 |
7 | 32561464613463 |
oct | 4632542131052 |
9 | 1145707227510 |
10 | 330000020010 |
11 | 117a52454371 |
12 | 53b58409976 |
13 | 251711ccb3b |
14 | 11d87593d6a |
15 | 88b62dda90 |
hex | 4cd588b22a |
330000020010 has 48 divisors (see below), whose sum is σ = 877953551904. Its totient is φ = 85953492576.
The previous prime is 330000019981. The next prime is 330000020029. The reversal of 330000020010 is 10020000033.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 330000019974 and 330000020001.
It is an unprimeable number.
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, 42631792 + ... + 42639531.
It is an arithmetic number, because the mean of its divisors is an integer number (18290698998).
Almost surely, 2330000020010 is an apocalyptic number.
330000020010 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
330000020010 is an abundant number, since it is smaller than the sum of its proper divisors (547953531894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330000020010 is a wasteful number, since it uses less digits than its factorization.
330000020010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85271379 (or 85271376 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 330000020010 its reverse (10020000033), we get a palindrome (340020020043).
The spelling of 330000020010 in words is "three hundred thirty billion, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •