Base | Representation |
---|---|
bin | 1001100110010001100011… |
… | …0101110100111101110000 |
3 | 1101100212112021012100112211 |
4 | 2121210120311310331300 |
5 | 2340400323230110112 |
6 | 34240014551301504 |
7 | 2136303633634030 |
oct | 231443065647560 |
9 | 41325467170484 |
10 | 10553151410032 |
11 | 33a962593a570 |
12 | 122533107a894 |
13 | 5b7208c0117a |
14 | 286abd41d8c0 |
15 | 1347a1e1c0a7 |
hex | 99918d74f70 |
10553151410032 has 40 divisors (see below), whose sum is σ = 25492028084352. Its totient is φ = 4111617432000.
The previous prime is 10553151409943. The next prime is 10553151410093. The reversal of 10553151410032 is 23001415135501.
10553151410032 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×105531514100322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10553151409976 and 10553151410003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4282933594 + ... + 4282936057.
Almost surely, 210553151410032 is an apocalyptic number.
It is an amenable number.
10553151410032 is an abundant number, since it is smaller than the sum of its proper divisors (14938876674320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10553151410032 is a wasteful number, since it uses less digits than its factorization.
10553151410032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8565869677 (or 8565869671 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 10553151410032 its reverse (23001415135501), we get a palindrome (33554566545533).
The spelling of 10553151410032 in words is "ten trillion, five hundred fifty-three billion, one hundred fifty-one million, four hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •