Base | Representation |
---|---|
bin | 11101110010010010011… |
… | …11011110011110011000 |
3 | 10121211122200000001220122 |
4 | 32321021033132132120 |
5 | 113231441314311300 |
6 | 2102054022212412 |
7 | 133640401024064 |
oct | 16711117363630 |
9 | 3554580001818 |
10 | 1023431010200 |
11 | 365042140735 |
12 | 146420b84108 |
13 | 75680736011 |
14 | 3776a28caa4 |
15 | 1b94d812c85 |
hex | ee493de798 |
1023431010200 has 48 divisors (see below), whose sum is σ = 2402578866480. Its totient is φ = 405397906560.
The previous prime is 1023431010187. The next prime is 1023431010263. The reversal of 1023431010200 is 20101343201.
It is a super-2 number, since 2×10234310102002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24819959 + ... + 24861158.
It is an arithmetic number, because the mean of its divisors is an integer number (50053726385).
Almost surely, 21023431010200 is an apocalyptic number.
1023431010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1023431010200 is an abundant number, since it is smaller than the sum of its proper divisors (1379147856280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023431010200 is a wasteful number, since it uses less digits than its factorization.
1023431010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49681236 (or 49681227 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1023431010200 its reverse (20101343201), we get a palindrome (1043532353401).
The spelling of 1023431010200 in words is "one trillion, twenty-three billion, four hundred thirty-one million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •