Base | Representation |
---|---|
bin | 11101110010010000010… |
… | …11001010011000111110 |
3 | 10121211121102022020200020 |
4 | 32321020023022120332 |
5 | 113231422223232032 |
6 | 2102052142313010 |
7 | 133640062560024 |
oct | 16711013123076 |
9 | 3554542266606 |
10 | 1023413102142 |
11 | 36503301a092 |
12 | 146416b88766 |
13 | 75679b05b32 |
14 | 37767b4a714 |
15 | 1b94be76b2c |
hex | ee482ca63e |
1023413102142 has 8 divisors (see below), whose sum is σ = 2046826204296. Its totient is φ = 341137700712.
The previous prime is 1023413102123. The next prime is 1023413102149. The reversal of 1023413102142 is 2412013143201.
1023413102142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1023413102142 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023413102149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85284425173 + ... + 85284425184.
It is an arithmetic number, because the mean of its divisors is an integer number (255853275537).
Almost surely, 21023413102142 is an apocalyptic number.
1023413102142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023413102142 is a wasteful number, since it uses less digits than its factorization.
1023413102142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170568850362.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1023413102142 its reverse (2412013143201), we get a palindrome (3435426245343).
The spelling of 1023413102142 in words is "one trillion, twenty-three billion, four hundred thirteen million, one hundred two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •