Base | Representation |
---|---|
bin | 10111001110001110111110… |
… | …111010011100001010000110 |
3 | 111101121211201102112000000122 |
4 | 113032032332322130022012 |
5 | 101341322323430303220 |
6 | 1001115205215541542 |
7 | 30340611441535055 |
oct | 2716167672341206 |
9 | 441554642460018 |
10 | 102133230322310 |
11 | 2a5a7506a00050 |
12 | b55613022a8b2 |
13 | 44cb1788a9255 |
14 | 1b313bbbaa39c |
15 | bc1abdeed425 |
hex | 5ce3bee9c286 |
102133230322310 has 64 divisors (see below), whose sum is σ = 202699372276800. Its totient is φ = 36742091857920.
The previous prime is 102133230322273. The next prime is 102133230322367. The reversal of 102133230322310 is 13223032331201.
It is a super-2 number, since 2×1021332303223102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102133230322310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25411466 + ... + 29154914.
It is an arithmetic number, because the mean of its divisors is an integer number (3167177691825).
Almost surely, 2102133230322310 is an apocalyptic number.
102133230322310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102133230322310 is a deficient number, since it is larger than the sum of its proper divisors (100566141954490).
102133230322310 is a wasteful number, since it uses less digits than its factorization.
102133230322310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3746121.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 102133230322310 its reverse (13223032331201), we get a palindrome (115356262653511).
The spelling of 102133230322310 in words is "one hundred two trillion, one hundred thirty-three billion, two hundred thirty million, three hundred twenty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •