Base | Representation |
---|---|
bin | 10111000010011001111001… |
… | …010010001000111100111000 |
3 | 111021202010102211202002200220 |
4 | 113002121321102020330320 |
5 | 101240013000201423112 |
6 | 555253524231100040 |
7 | 30225102550130034 |
oct | 2702317122107470 |
9 | 437663384662626 |
10 | 101320313311032 |
11 | 2a3137814a3622 |
12 | b44467bb11620 |
13 | 446c6067c674a |
14 | 1b03d0211d1c4 |
15 | baa891bed98c |
hex | 5c2679488f38 |
101320313311032 has 64 divisors (see below), whose sum is σ = 253759649152800. Its totient is φ = 33712272230400.
The previous prime is 101320313311027. The next prime is 101320313311067. The reversal of 101320313311032 is 230113313023101.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 101320313310993 and 101320313311011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97987188 + ... + 99015804.
Almost surely, 2101320313311032 is an apocalyptic number.
101320313311032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101320313311032 is an abundant number, since it is smaller than the sum of its proper divisors (152439335841768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101320313311032 is a wasteful number, since it uses less digits than its factorization.
101320313311032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1036056 (or 1036052 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 101320313311032 its reverse (230113313023101), we get a palindrome (331433626334133).
The spelling of 101320313311032 in words is "one hundred one trillion, three hundred twenty billion, three hundred thirteen million, three hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •