Base | Representation |
---|---|
bin | 11101011001101011111… |
… | …10111101010011001110 |
3 | 10120120120011211012012220 |
4 | 32230311332331103032 |
5 | 113022414042323042 |
6 | 2052031241040210 |
7 | 132662160624621 |
oct | 16546576752316 |
9 | 3516504735186 |
10 | 1010223011022 |
11 | 35a48460a435 |
12 | 143955786066 |
13 | 743572390a4 |
14 | 36c7605bdb8 |
15 | 1b428ec68ec |
hex | eb35fbd4ce |
1010223011022 has 8 divisors (see below), whose sum is σ = 2020446022056. Its totient is φ = 336741003672.
The previous prime is 1010223011003. The next prime is 1010223011041. The reversal of 1010223011022 is 2201103220101.
It is an interprime number because it is at equal distance from previous prime (1010223011003) and next prime (1010223011041).
It is a sphenic number, since it is the product of 3 distinct primes.
1010223011022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1010223010992 and 1010223011010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84185250913 + ... + 84185250924.
It is an arithmetic number, because the mean of its divisors is an integer number (252555752757).
Almost surely, 21010223011022 is an apocalyptic number.
1010223011022 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.
1010223011022 is a wasteful number, since it uses less digits than its factorization.
1010223011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168370501842.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1010223011022 its reverse (2201103220101), we get a palindrome (3211326231123).
The spelling of 1010223011022 in words is "one trillion, ten billion, two hundred twenty-three million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •