Base | Representation |
---|---|
bin | 101111100011001101… |
… | …1010101001000001000 |
3 | 100202120110012011020010 |
4 | 1133012123111020020 |
5 | 3133112001113000 |
6 | 114524334231520 |
7 | 10243314510624 |
oct | 1370633251010 |
9 | 322513164203 |
10 | 102113301000 |
11 | 3a340329457 |
12 | 179596555a0 |
13 | 98245a67c9 |
14 | 4d299b0184 |
15 | 29c9a2cd50 |
hex | 17c66d5208 |
102113301000 has 64 divisors (see below), whose sum is σ = 318593508480. Its totient is φ = 27230212800.
The previous prime is 102113300941. The next prime is 102113301023. The reversal of 102113301000 is 103311201.
It is a super-2 number, since 2×1021133010002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17015884 + ... + 17021883.
It is an arithmetic number, because the mean of its divisors is an integer number (4978023570).
Almost surely, 2102113301000 is an apocalyptic number.
102113301000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102113301000 is an abundant number, since it is smaller than the sum of its proper divisors (216480207480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102113301000 is a wasteful number, since it uses less digits than its factorization.
102113301000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34037791 (or 34037777 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 102113301000 its reverse (103311201), we get a palindrome (102216612201).
The spelling of 102113301000 in words is "one hundred two billion, one hundred thirteen million, three hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •