Base | Representation |
---|---|
bin | 10111001110001110110111… |
… | …111011010100011011110110 |
3 | 111101121211102020222010010112 |
4 | 113032032313323110123312 |
5 | 101341322103424043220 |
6 | 1001115145431423022 |
7 | 30340605516344000 |
oct | 2716166773243366 |
9 | 441554366863115 |
10 | 102133113112310 |
11 | 2a5a7456824485 |
12 | b5560b8b24a72 |
13 | 44cb15a51b217 |
14 | 1b313aa3b9370 |
15 | bc1ab3a995c5 |
hex | 5ce3b7ed46f6 |
102133113112310 has 128 divisors (see below), whose sum is σ = 224934003302400. Its totient is φ = 33331949884800.
The previous prime is 102133113112301. The next prime is 102133113112421. The reversal of 102133113112310 is 13211311331201.
It is a super-2 number, since 2×1021331131123102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1387064 + ... + 14359323.
It is an arithmetic number, because the mean of its divisors is an integer number (1757296900800).
Almost surely, 2102133113112310 is an apocalyptic number.
102133113112310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102133113112310 is an abundant number, since it is smaller than the sum of its proper divisors (122800890190090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102133113112310 is a wasteful number, since it uses less digits than its factorization.
102133113112310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15746507 (or 15746493 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 102133113112310 its reverse (13211311331201), we get a palindrome (115344424443511).
The spelling of 102133113112310 in words is "one hundred two trillion, one hundred thirty-three billion, one hundred thirteen million, one hundred twelve thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •