Base | Representation |
---|---|
bin | 10111000010011011110000… |
… | …011010101001100001011110 |
3 | 111021202022121010200120002112 |
4 | 113002123300122221201132 |
5 | 101240031043334432202 |
6 | 555254454430354022 |
7 | 30225203230015646 |
oct | 2702336032514136 |
9 | 437668533616075 |
10 | 101322312030302 |
11 | 2a314607745a30 |
12 | b444b3935b912 |
13 | 446c864912b7c |
14 | 1b04051763526 |
15 | baa95c40bb52 |
hex | 5c26f06a985e |
101322312030302 has 64 divisors (see below), whose sum is σ = 169868626329600. Its totient is φ = 44928167356800.
The previous prime is 101322312030293. The next prime is 101322312030341. The reversal of 101322312030302 is 203030213223101.
101322312030302 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1013223120303022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7916417699 + ... + 7916430497.
It is an arithmetic number, because the mean of its divisors is an integer number (2654197286400).
Almost surely, 2101322312030302 is an apocalyptic number.
101322312030302 is a deficient number, since it is larger than the sum of its proper divisors (68546314299298).
101322312030302 is a wasteful number, since it uses less digits than its factorization.
101322312030302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22689.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 101322312030302 its reverse (203030213223101), we get a palindrome (304352525253403).
The spelling of 101322312030302 in words is "one hundred one trillion, three hundred twenty-two billion, three hundred twelve million, thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •