Base | Representation |
---|---|
bin | 10111011100011111011101… |
… | …110111100011000010000111 |
3 | 111112002111200102011101221210 |
4 | 113130133131313203002013 |
5 | 102003400412030414343 |
6 | 1003145243111342503 |
7 | 30501445214231130 |
oct | 2734373567430207 |
9 | 445074612141853 |
10 | 103113002201223 |
11 | 2a944a846571a3 |
12 | b693ba7981a33 |
13 | 456c68c148171 |
14 | 1b669a5908c87 |
15 | bdc314987333 |
hex | 5dc7ddde3087 |
103113002201223 has 32 divisors (see below), whose sum is σ = 166371495699456. Its totient is φ = 55454299319808.
The previous prime is 103113002201213. The next prime is 103113002201243. The reversal of 103113002201223 is 322102200311301.
It is not a de Polignac number, because 103113002201223 - 213 = 103113002193031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 103113002201223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103113002201213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10176165 + ... + 17600577.
It is an arithmetic number, because the mean of its divisors is an integer number (5199109240608).
Almost surely, 2103113002201223 is an apocalyptic number.
103113002201223 is a deficient number, since it is larger than the sum of its proper divisors (63258493498233).
103113002201223 is a wasteful number, since it uses less digits than its factorization.
103113002201223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7463343.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103113002201223 its reverse (322102200311301), we get a palindrome (425215202512524).
The spelling of 103113002201223 in words is "one hundred three trillion, one hundred thirteen billion, two million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •