Search a number
-
+
1010243101032 = 23321119611100569
BaseRepresentation
bin11101011001101110010…
…11100110000101101000
310120120121120121212112100
432230313023212011220
5113022434213213112
62052033235413400
7132662523450234
oct16546713460550
93516546555470
101010243101032
1135a494991350
12143960454260
137435b451479
1436c789ab5c4
151b42ab442dc
hexeb372e6168

1010243101032 has 192 divisors, whose sum is σ = 3193413912000. Its totient is φ = 285267225600.

The previous prime is 1010243101027. The next prime is 1010243101037. The reversal of 1010243101032 is 2301013420101.

It is an interprime number because it is at equal distance from previous prime (1010243101027) and next prime (1010243101037).

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

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

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

It is not an unprimeable number, because it can be changed into a prime (1010243101037) by changing a digit.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 367644 + ... + 1468212.

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

Almost surely, 21010243101032 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 1010243101032 its reverse (2301013420101), we get a palindrome (3311256521133).

It can be divided in two parts, 10102 and 43101032, that added together give a palindrome (43111134).

The spelling of 1010243101032 in words is "one trillion, ten billion, two hundred forty-three million, one hundred one thousand, thirty-two".