Base | Representation |
---|---|
bin | 101111001001000101… |
… | …0010011001011001111 |
3 | 100200022100012001110012 |
4 | 1132102022103023033 |
5 | 3124313010440302 |
6 | 114301331503435 |
7 | 10212506245256 |
oct | 1362212231317 |
9 | 320270161405 |
10 | 101236421327 |
11 | 39a30358808 |
12 | 17753a57b7b |
13 | 9714a168b2 |
14 | 4c8535179d |
15 | 2977a6ba52 |
hex | 17922932cf |
101236421327 has 4 divisors (see below), whose sum is σ = 101250975840. Its totient is φ = 101221866816.
The previous prime is 101236421309. The next prime is 101236421333. The reversal of 101236421327 is 723124632101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 723124632101 = 61757 ⋅11709193.
It is a cyclic number.
It is not a de Polignac number, because 101236421327 - 28 = 101236421071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101236421293 and 101236421302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101236421227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7266818 + ... + 7280735.
It is an arithmetic number, because the mean of its divisors is an integer number (25312743960).
Almost surely, 2101236421327 is an apocalyptic number.
101236421327 is a deficient number, since it is larger than the sum of its proper divisors (14554513).
101236421327 is an equidigital number, since it uses as much as digits as its factorization.
101236421327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14554512.
The product of its (nonzero) digits is 12096, while the sum is 32.
The spelling of 101236421327 in words is "one hundred one billion, two hundred thirty-six million, four hundred twenty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •