Base | Representation |
---|---|
bin | 11101011001101010100… |
… | …01001001101111000100 |
3 | 10120120112100020010202122 |
4 | 32230311101021233010 |
5 | 113022403004101312 |
6 | 2052030131425112 |
7 | 132661653564026 |
oct | 16546521115704 |
9 | 3516470203678 |
10 | 1010211003332 |
11 | 35a478858923 |
12 | 143951755198 |
13 | 743548c374b |
14 | 36c74614016 |
15 | 1b427e03b72 |
hex | eb35449bc4 |
1010211003332 has 24 divisors (see below), whose sum is σ = 1774185336000. Its totient is φ = 503301457376.
The previous prime is 1010211003313. The next prime is 1010211003337. The reversal of 1010211003332 is 2333001120101.
1010211003332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10102110033322 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1010211003332.
It is not an unprimeable number, because it can be changed into a prime (1010211003337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7668719 + ... + 7799337.
It is an arithmetic number, because the mean of its divisors is an integer number (73924389000).
Almost surely, 21010211003332 is an apocalyptic number.
It is an amenable number.
1010211003332 is a deficient number, since it is larger than the sum of its proper divisors (763974332668).
1010211003332 is a wasteful number, since it uses less digits than its factorization.
1010211003332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137515 (or 137513 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1010211003332 its reverse (2333001120101), we get a palindrome (3343212123433).
The spelling of 1010211003332 in words is "one trillion, ten billion, two hundred eleven million, three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •