Base | Representation |
---|---|
bin | 10111000010100011111110… |
… | …000100011000110001001010 |
3 | 111021210011100202011011002202 |
4 | 113002203332010120301022 |
5 | 101240202124014310442 |
6 | 555302513504000202 |
7 | 30225634614062246 |
oct | 2702437604306112 |
9 | 437704322134082 |
10 | 101331131010122 |
11 | 2a318322838002 |
12 | b44679a900062 |
13 | 447063ba22b20 |
14 | 1b0464aad7426 |
15 | baacc677cc32 |
hex | 5c28fe118c4a |
101331131010122 has 8 divisors (see below), whose sum is σ = 163688750093316. Its totient is φ = 46768214312352.
The previous prime is 101331131010121. The next prime is 101331131010173. The reversal of 101331131010122 is 221010131133101.
It can be written as a sum of positive squares in 2 ways, for example, as 99129881047201 + 2201249962921 = 9956399^2 + 1483661^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1013311310101222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101331131010094 and 101331131010103.
It is not an unprimeable number, because it can be changed into a prime (101331131010121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1948675596323 + ... + 1948675596374.
Almost surely, 2101331131010122 is an apocalyptic number.
101331131010122 is a deficient number, since it is larger than the sum of its proper divisors (62357619083194).
101331131010122 is a wasteful number, since it uses less digits than its factorization.
101331131010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3897351192712.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 101331131010122 its reverse (221010131133101), we get a palindrome (322341262143223).
The spelling of 101331131010122 in words is "one hundred one trillion, three hundred thirty-one billion, one hundred thirty-one million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •