Base | Representation |
---|---|
bin | 10111011100011100110010… |
… | …110010111111100010100010 |
3 | 111112002020021101120022210211 |
4 | 113130130302302333202202 |
5 | 102003324022304301310 |
6 | 1003144050223244334 |
7 | 30501314123630602 |
oct | 2734346262774242 |
9 | 445066241508724 |
10 | 103110132103330 |
11 | 2a943841551170 |
12 | b6935267496aa |
13 | 456c3226469a1 |
14 | 1b667b2678c02 |
15 | bdc1e7a02c8a |
hex | 5dc732cbf8a2 |
103110132103330 has 32 divisors (see below), whose sum is σ = 213127163012160. Its totient is φ = 35521193833920.
The previous prime is 103110132103313. The next prime is 103110132103331. The reversal of 103110132103330 is 33301231011301.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (103110132103331) 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, 24667493629 + ... + 24667497808.
It is an arithmetic number, because the mean of its divisors is an integer number (6660223844130).
Almost surely, 2103110132103330 is an apocalyptic number.
103110132103330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103110132103330 is an abundant number, since it is smaller than the sum of its proper divisors (110017030908830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103110132103330 is a wasteful number, since it uses less digits than its factorization.
103110132103330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49334991474.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 103110132103330 its reverse (33301231011301), we get a palindrome (136411363114631).
The spelling of 103110132103330 in words is "one hundred three trillion, one hundred ten billion, one hundred thirty-two million, one hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •