1020300462 has 40 divisors (see below), whose sum is σ = 2297790000. Its totient is φ = 338380416.

The previous prime is 1020300397. The next prime is 1020300467. The reversal of 1020300462 is 2640030201.

It is a happy number.

1020300462 is a `hidden beast` number, since 1 + 0 + 203 + 0 + 0 + 462 = 666.

1020300462 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-3 number, since 3×1020300462³ (a number of 28 digits) contains 333 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 not an unprimeable number, because it can be changed into a prime (1020300467) by changing a digit.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 16414 + ... + 48062.

It is an arithmetic number, because the mean of its divisors is an integer number (57444750).

Almost surely, 2^1020300462 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1020300462, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1148895000).

1020300462 is an abundant number, since it is smaller than the sum of its proper divisors (1277489538).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1020300462 is a wasteful number, since it uses less digits than its factorization.

1020300462 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 31862 (or 31853 counting only the distinct ones).

The product of its (nonzero) digits is 288, while the sum is 18.

The square root of 1020300462 is about 31942.1424140586. The cubic root of 1020300462 is about 1006.7215403378.

Adding to 1020300462 its reverse (2640030201), we get a palindrome (3660330663).

The spelling of 1020300462 in words is "one billion, twenty million, three hundred thousand, four hundred sixty-two".