Base | Representation |
---|---|
bin | 11101011011001011001… |
… | …11101111100111001010 |
3 | 10120122121212200211022020 |
4 | 32231211213233213022 |
5 | 113031033142411020 |
6 | 2052242431105310 |
7 | 133021034115150 |
oct | 16554547574712 |
9 | 3518555624266 |
10 | 1011022232010 |
11 | 35a854768a4a |
12 | 143b39372236 |
13 | 744539a850b |
14 | 36d102633d0 |
15 | 1b474247c40 |
hex | eb659ef9ca |
1011022232010 has 128 divisors (see below), whose sum is σ = 2826671800320. Its totient is φ = 226629501696.
The previous prime is 1011022231987. The next prime is 1011022232021. The reversal of 1011022232010 is 102322201101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26503731 + ... + 26541849.
It is an arithmetic number, because the mean of its divisors is an integer number (22083373440).
Almost surely, 21011022232010 is an apocalyptic number.
1011022232010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1011022232010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1413335900160).
1011022232010 is an abundant number, since it is smaller than the sum of its proper divisors (1815649568310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011022232010 is a wasteful number, since it uses less digits than its factorization.
1011022232010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40572.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1011022232010 its reverse (102322201101), we get a palindrome (1113344433111).
The spelling of 1011022232010 in words is "one trillion, eleven billion, twenty-two million, two hundred thirty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •