Base | Representation |
---|---|
bin | 10111000010010000010100… |
… | …011011000101000111100111 |
3 | 111021201010220021011211002211 |
4 | 113002100110123011013213 |
5 | 101234330420443034343 |
6 | 555245104050144251 |
7 | 30224260005611566 |
oct | 2702202433050747 |
9 | 437633807154084 |
10 | 101310031221223 |
11 | 2a30a385528340 |
12 | b442690582087 |
13 | 446b65853c636 |
14 | 1b03608729bdd |
15 | baa48e1bd79d |
hex | 5c24146c51e7 |
101310031221223 has 16 divisors (see below), whose sum is σ = 111669435198720. Its totient is φ = 91142364499200.
The previous prime is 101310031221169. The next prime is 101310031221271. The reversal of 101310031221223 is 322122130013101.
It is a cyclic number.
It is not a de Polignac number, because 101310031221223 - 29 = 101310031220711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101310031221194 and 101310031221203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101310031221283) 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, 7652308 + ... + 16160998.
It is an arithmetic number, because the mean of its divisors is an integer number (6979339699920).
Almost surely, 2101310031221223 is an apocalyptic number.
101310031221223 is a deficient number, since it is larger than the sum of its proper divisors (10359403977497).
101310031221223 is a wasteful number, since it uses less digits than its factorization.
101310031221223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8519958.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 101310031221223 its reverse (322122130013101), we get a palindrome (423432161234324).
The spelling of 101310031221223 in words is "one hundred one trillion, three hundred ten billion, thirty-one million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •