Search a number
-
+
20000001690 = 2325222222241
BaseRepresentation
bin10010101000000101…
…111100111010011010
31220121211112100120100
4102220011330322122
5311430000023230
613104325240230
71305422131554
oct225005747232
956554470510
1020000001690
118533530319
123a61b63076
131b696a8636
14d7a2c64d4
157c0c6b660
hex4a817ce9a

20000001690 has 24 divisors (see below), whose sum is σ = 52000004628. Its totient is φ = 5333333760.

The previous prime is 20000001689. The next prime is 20000001701. The reversal of 20000001690 is 9610000002.

It can be written as a sum of positive squares in 2 ways, for example, as 18238772601 + 1761229089 = 135051^2 + 41967^2 .

It is a super-2 number, since 2×200000016902 (a number of 21 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (18).

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 11 ways as a sum of consecutive naturals, for example, 111111031 + ... + 111111210.

Almost surely, 220000001690 is an apocalyptic number.

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

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

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

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

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

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

Adding to 20000001690 its reverse (9610000002), we get a palindrome (29610001692).

The spelling of 20000001690 in words is "twenty billion, one thousand, six hundred ninety".

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 222222241 444444482 666666723 1111111205 1333333446 2000000169 2222222410 3333333615 4000000338 6666667230 10000000845 20000001690