Base | Representation |
---|---|
bin | 10111000010100100001000… |
… | …110000011100000101101111 |
3 | 111021210011211020120120000222 |
4 | 113002210020300130011233 |
5 | 101240203010421031343 |
6 | 555302543351241555 |
7 | 30225642222216341 |
oct | 2702441060340557 |
9 | 437704736516028 |
10 | 101331310330223 |
11 | 2a318404a85936 |
12 | b44682a9792bb |
13 | 4470669c193ac |
14 | 1b04666855291 |
15 | baacd739ea68 |
hex | 5c2908c1c16f |
101331310330223 has 16 divisors (see below), whose sum is σ = 105790669822464. Its totient is φ = 96967176878880.
The previous prime is 101331310330213. The next prime is 101331310330259. The reversal of 101331310330223 is 322033013133101.
It is not a de Polignac number, because 101331310330223 - 222 = 101331306135919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101331310330192 and 101331310330201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101331310330213) 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, 30825515 + ... + 33954012.
It is an arithmetic number, because the mean of its divisors is an integer number (6611916863904).
Almost surely, 2101331310330223 is an apocalyptic number.
101331310330223 is a deficient number, since it is larger than the sum of its proper divisors (4459359492241).
101331310330223 is an equidigital number, since it uses as much as digits as its factorization.
101331310330223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64780262.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 101331310330223 its reverse (322033013133101), we get a palindrome (423364323463324).
The spelling of 101331310330223 in words is "one hundred one trillion, three hundred thirty-one billion, three hundred ten million, three hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •