Base | Representation |
---|---|
bin | 10111000010011100011001… |
… | …011110111010001100011101 |
3 | 111021202101101011010111201000 |
4 | 113002130121132322030131 |
5 | 101240034001224404041 |
6 | 555255051041540513 |
7 | 30225226264202634 |
oct | 2702343136721435 |
9 | 437671334114630 |
10 | 101323001013021 |
11 | 2a31493064a937 |
12 | b4450b0044739 |
13 | 446c944595658 |
14 | 1b040b907051b |
15 | baa99cb54bb6 |
hex | 5c27197ba31d |
101323001013021 has 16 divisors (see below), whose sum is σ = 150113144635200. Its totient is φ = 67546419598224.
The previous prime is 101323001012983. The next prime is 101323001013049. The reversal of 101323001013021 is 120310100323101.
It is not a de Polignac number, because 101323001013021 - 221 = 101322998915869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101323001012985 and 101323001013003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101323001013061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61610706 + ... + 63233891.
It is an arithmetic number, because the mean of its divisors is an integer number (9382071539700).
Almost surely, 2101323001013021 is an apocalyptic number.
It is an amenable number.
101323001013021 is a deficient number, since it is larger than the sum of its proper divisors (48790143622179).
101323001013021 is a wasteful number, since it uses less digits than its factorization.
101323001013021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124874665 (or 124874659 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 101323001013021 its reverse (120310100323101), we get a palindrome (221633101336122).
The spelling of 101323001013021 in words is "one hundred one trillion, three hundred twenty-three billion, one million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •