Base | Representation |
---|---|
bin | 11101101111110111011… |
… | …01101101101100100111 |
3 | 10121201022000111212012011 |
4 | 32313323231231230213 |
5 | 113221310330022043 |
6 | 2101320555535051 |
7 | 133563225214000 |
oct | 16677355555447 |
9 | 3551260455164 |
10 | 1022130314023 |
11 | 364534a08415 |
12 | 14611945a487 |
13 | 75504116200 |
14 | 3768562a1a7 |
15 | 1b8c453659d |
hex | edfbb6db27 |
1022130314023 has 48 divisors (see below), whose sum is σ = 1358668128000. Its totient is φ = 766153533600.
The previous prime is 1022130313973. The next prime is 1022130314027. The reversal of 1022130314023 is 3204130312201.
It is not a de Polignac number, because 1022130314023 - 213 = 1022130305831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022130313985 and 1022130314003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022130314027) 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, 637348 + ... + 1565398.
It is an arithmetic number, because the mean of its divisors is an integer number (28305586000).
Almost surely, 21022130314023 is an apocalyptic number.
1022130314023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1022130314023 is a deficient number, since it is larger than the sum of its proper divisors (336537813977).
1022130314023 is an equidigital number, since it uses as much as digits as its factorization.
1022130314023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 928117 (or 928090 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1022130314023 its reverse (3204130312201), we get a palindrome (4226260626224).
The spelling of 1022130314023 in words is "one trillion, twenty-two billion, one hundred thirty million, three hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •