Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1100111000101110111 |
3 | 100122221222021220122112 |
4 | 1132022021213011313 |
5 | 3124024104214111 |
6 | 114240131121235 |
7 | 10206255005432 |
oct | 1361211470567 |
9 | 318858256575 |
10 | 101102023031 |
11 | 39971502339 |
12 | 17716a4321b |
13 | 96c2c1b189 |
14 | 4c71568819 |
15 | 296ad6ee8b |
hex | 178a267177 |
101102023031 has 4 divisors (see below), whose sum is σ = 103253129952. Its totient is φ = 98950916112.
The previous prime is 101102023021. The next prime is 101102023037. The reversal of 101102023031 is 130320201101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101102023031 is a prime.
It is a super-2 number, since 2×1011020230312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101102022997 and 101102023015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102023037) 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, 1075553390 + ... + 1075553483.
It is an arithmetic number, because the mean of its divisors is an integer number (25813282488).
Almost surely, 2101102023031 is an apocalyptic number.
101102023031 is a deficient number, since it is larger than the sum of its proper divisors (2151106921).
101102023031 is an equidigital number, since it uses as much as digits as its factorization.
101102023031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2151106920.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 101102023031 its reverse (130320201101), we get a palindrome (231422224132).
The spelling of 101102023031 in words is "one hundred one billion, one hundred two million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •