Base | Representation |
---|---|
bin | 101111100011001101… |
… | …0100111010010001110 |
3 | 100202120102211121122200 |
4 | 1133012122213102032 |
5 | 3133111424110410 |
6 | 114524330222330 |
7 | 10243313066322 |
oct | 1370632472216 |
9 | 322512747580 |
10 | 102113113230 |
11 | 3a340210377 |
12 | 179595849a6 |
13 | 982453c1bb |
14 | 4d29961982 |
15 | 29c99e23c0 |
hex | 17c66a748e |
102113113230 has 24 divisors (see below), whose sum is σ = 265494094632. Its totient is φ = 27230163504.
The previous prime is 102113113213. The next prime is 102113113231. The reversal of 102113113230 is 32311311201.
102113113230 is a `hidden beast` number, since 10 + 21 + 1 + 311 + 323 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102113113231) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 567294984 + ... + 567295163.
It is an arithmetic number, because the mean of its divisors is an integer number (11062253943).
Almost surely, 2102113113230 is an apocalyptic number.
102113113230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102113113230 is an abundant number, since it is smaller than the sum of its proper divisors (163380981402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102113113230 is a wasteful number, since it uses less digits than its factorization.
102113113230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1134590160 (or 1134590157 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 102113113230 its reverse (32311311201), we get a palindrome (134424424431).
The spelling of 102113113230 in words is "one hundred two billion, one hundred thirteen million, one hundred thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •