Base | Representation |
---|---|
bin | 1001010010011000010010… |
… | …0100000011000000111000 |
3 | 1100011012022022211000100020 |
4 | 2110212010210003000320 |
5 | 2314300331443222012 |
6 | 33415011251210440 |
7 | 2102514023653365 |
oct | 224460444030070 |
9 | 40135268730306 |
10 | 10211361304632 |
11 | 3287683279584 |
12 | 118b0442a6a20 |
13 | 590c091b5857 |
14 | 27433809146c |
15 | 12a94aa24a8c |
hex | 94984903038 |
10211361304632 has 16 divisors (see below), whose sum is σ = 25528403261640. Its totient is φ = 3403787101536.
The previous prime is 10211361304553. The next prime is 10211361304649. The reversal of 10211361304632 is 23640316311201.
It is a super-2 number, since 2×102113613046322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10211361304593 and 10211361304602.
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, 212736693823 + ... + 212736693870.
Almost surely, 210211361304632 is an apocalyptic number.
10211361304632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10211361304632 is an abundant number, since it is smaller than the sum of its proper divisors (15317041957008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211361304632 is a wasteful number, since it uses less digits than its factorization.
10211361304632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 425473387702 (or 425473387698 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 33.
Adding to 10211361304632 its reverse (23640316311201), we get a palindrome (33851677615833).
The spelling of 10211361304632 in words is "ten trillion, two hundred eleven billion, three hundred sixty-one million, three hundred four thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •