Base | Representation |
---|---|
bin | 11101101101110010001… |
… | …01010011000110000001 |
3 | 10121121102010000010001110 |
4 | 32312321011103012001 |
5 | 113212013140014131 |
6 | 2101014023353533 |
7 | 133523432254422 |
oct | 16667105230601 |
9 | 3547363003043 |
10 | 1021012423041 |
11 | 364010993376 |
12 | 145a66bb28a9 |
13 | 75386640060 |
14 | 375bad91649 |
15 | 1b85b319646 |
hex | edb9153181 |
1021012423041 has 16 divisors (see below), whose sum is σ = 1466109953280. Its totient is φ = 628297837440.
The previous prime is 1021012423007. The next prime is 1021012423051. The reversal of 1021012423041 is 1403242101201.
It is not a de Polignac number, because 1021012423041 - 26 = 1021012422977 is a prime.
It is a super-3 number, since 3×10210124230413 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1021012422999 and 1021012423017.
It is not an unprimeable number, because it can be changed into a prime (1021012423051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1131325 + ... + 1822613.
It is an arithmetic number, because the mean of its divisors is an integer number (91631872080).
Almost surely, 21021012423041 is an apocalyptic number.
It is an amenable number.
1021012423041 is a deficient number, since it is larger than the sum of its proper divisors (445097530239).
1021012423041 is a wasteful number, since it uses less digits than its factorization.
1021012423041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729176.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1021012423041 its reverse (1403242101201), we get a palindrome (2424254524242).
The spelling of 1021012423041 in words is "one trillion, twenty-one billion, twelve million, four hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •