Search a number
-
+
1451101030 = 25473087449
BaseRepresentation
bin101011001111110…
…0000101101100110
310202010111120101121
41112133200231212
510432440213110
6355554044154
750650104151
oct12637405546
93663446347
101451101030
11685121755
12345b7965a
131a1831082
14daa14c98
15875dacda
hex567e0b66

1451101030 has 16 divisors (see below), whose sum is σ = 2667556800. Its totient is φ = 568090432.

The previous prime is 1451101013. The next prime is 1451101031. The reversal of 1451101030 is 301011541.

It is a junction number, because it is equal to n+sod(n) for n = 1451100995 and 1451101013.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1451101031) 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 7 ways as a sum of consecutive naturals, for example, 1543255 + ... + 1544194.

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

Almost surely, 21451101030 is an apocalyptic number.

1451101030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

1451101030 is a deficient number, since it is larger than the sum of its proper divisors (1216455770).

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

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

The sum of its prime factors is 3087503.

The product of its (nonzero) digits is 60, while the sum is 16.

The square root of 1451101030 is about 38093.3200180819. The cubic root of 1451101030 is about 1132.1376067282.

Adding to 1451101030 its reverse (301011541), we get a palindrome (1752112571).

The spelling of 1451101030 in words is "one billion, four hundred fifty-one million, one hundred one thousand, thirty".

Divisors: 1 2 5 10 47 94 235 470 3087449 6174898 15437245 30874490 145110103 290220206 725550515 1451101030