Base | Representation |
---|---|
bin | 10111000001001010001110… |
… | …101111110111111101110101 |
3 | 111021102221122110121000010210 |
4 | 113001022032233313331311 |
5 | 101232112304131101042 |
6 | 555150340240340033 |
7 | 30215654034514635 |
oct | 2701121657677565 |
9 | 437387573530123 |
10 | 101234774081397 |
11 | 2a290476869310 |
12 | b42bb89014619 |
13 | 4464523bc3c78 |
14 | 1addb098386c5 |
15 | ba85372b1a9c |
hex | 5c128ebf7f75 |
101234774081397 has 32 divisors (see below), whose sum is σ = 147728860231680. Its totient is φ = 61155138152000.
The previous prime is 101234774081387. The next prime is 101234774081489. The reversal of 101234774081397 is 793180477432101.
It is a cyclic number.
It is not a de Polignac number, because 101234774081397 - 211 = 101234774079349 is a prime.
It is a super-2 number, since 2×1012347740813972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101234774081387) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 353304247 + ... + 353590667.
It is an arithmetic number, because the mean of its divisors is an integer number (4616526882240).
Almost surely, 2101234774081397 is an apocalyptic number.
It is an amenable number.
101234774081397 is a deficient number, since it is larger than the sum of its proper divisors (46494086150283).
101234774081397 is a wasteful number, since it uses less digits than its factorization.
101234774081397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321185.
The product of its (nonzero) digits is 7112448, while the sum is 57.
The spelling of 101234774081397 in words is "one hundred one trillion, two hundred thirty-four billion, seven hundred seventy-four million, eighty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •