Base | Representation |
---|---|
bin | 11101011001100001010… |
… | …00011011111100001010 |
3 | 10120120022220212101122100 |
4 | 32230300220123330022 |
5 | 113022223101034010 |
6 | 2052014312334230 |
7 | 132660020465535 |
oct | 16546050337412 |
9 | 3516286771570 |
10 | 1010133221130 |
11 | 35a438961a10 |
12 | 14392b6a4376 |
13 | 7434175b987 |
14 | 36c68167a1c |
15 | 1b42118c2c0 |
hex | eb30a1bf0a |
1010133221130 has 96 divisors (see below), whose sum is σ = 2901372514560. Its totient is φ = 241781005440.
The previous prime is 1010133221113. The next prime is 1010133221197. The reversal of 1010133221130 is 311223310101.
1010133221130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6379617 + ... + 6536036.
It is an arithmetic number, because the mean of its divisors is an integer number (30222630360).
Almost surely, 21010133221130 is an apocalyptic number.
1010133221130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010133221130 is an abundant number, since it is smaller than the sum of its proper divisors (1891239293430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010133221130 is a wasteful number, since it uses less digits than its factorization.
1010133221130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12915756 (or 12915753 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1010133221130 its reverse (311223310101), we get a palindrome (1321356531231).
The spelling of 1010133221130 in words is "one trillion, ten billion, one hundred thirty-three million, two hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •