Base | Representation |
---|---|
bin | 11101110010010000010… |
… | …10111100000001100101 |
3 | 10121211121102012020221221 |
4 | 32321020022330001211 |
5 | 113231422214341201 |
6 | 2102052141140341 |
7 | 133640062223335 |
oct | 16711012740145 |
9 | 3554542166857 |
10 | 1023413043301 |
11 | 365032a89960 |
12 | 146416b5a6b1 |
13 | 75679ab510c |
14 | 37767b330c5 |
15 | 1b94be644a1 |
hex | ee482bc065 |
1023413043301 has 16 divisors (see below), whose sum is σ = 1192969356480. Its totient is φ = 867614042880.
The previous prime is 1023413043281. The next prime is 1023413043311. The reversal of 1023413043301 is 1033403143201.
It is a cyclic number.
It is not a de Polignac number, because 1023413043301 - 29 = 1023413042789 is a prime.
It is a super-2 number, since 2×10234130433012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023413043311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25084191 + ... + 25124956.
It is an arithmetic number, because the mean of its divisors is an integer number (74560584780).
Almost surely, 21023413043301 is an apocalyptic number.
1023413043301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1023413043301 is a deficient number, since it is larger than the sum of its proper divisors (169556313179).
1023413043301 is a wasteful number, since it uses less digits than its factorization.
1023413043301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50209284.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1023413043301 its reverse (1033403143201), we get a palindrome (2056816186502).
The spelling of 1023413043301 in words is "one trillion, twenty-three billion, four hundred thirteen million, forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •