Base | Representation |
---|---|
bin | 10111000010001001111110… |
… | …100000111111110000001101 |
3 | 111021200111022122222000221200 |
4 | 113002021332200333300031 |
5 | 101234222444113104123 |
6 | 555242020220220113 |
7 | 30223626154563630 |
oct | 2702117640776015 |
9 | 437614278860850 |
10 | 101303221222413 |
11 | 2a307500457451 |
12 | b4412ab99a639 |
13 | 446ab116cc842 |
14 | 1b0316010bc17 |
15 | baa1e13d6143 |
hex | 5c227e83fc0d |
101303221222413 has 48 divisors (see below), whose sum is σ = 167471492837376. Its totient is φ = 57804262981920.
The previous prime is 101303221222387. The next prime is 101303221222433. The reversal of 101303221222413 is 314222122303101.
101303221222413 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 0 + 3 + 2 + 21 + 222 + 413 = 666.
It is not a de Polignac number, because 101303221222413 - 218 = 101303220960269 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101303221222433) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 134298556 + ... + 135050762.
It is an arithmetic number, because the mean of its divisors is an integer number (3488989434112).
Almost surely, 2101303221222413 is an apocalyptic number.
It is an amenable number.
101303221222413 is a deficient number, since it is larger than the sum of its proper divisors (66168271614963).
101303221222413 is a wasteful number, since it uses less digits than its factorization.
101303221222413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 755294 (or 755291 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 101303221222413 its reverse (314222122303101), we get a palindrome (415525343525514).
The spelling of 101303221222413 in words is "one hundred one trillion, three hundred three billion, two hundred twenty-one million, two hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •