Base | Representation |
---|---|
bin | 10111001100011100001101… |
… | …111100110101110110011000 |
3 | 111101012001122110020212210220 |
4 | 113030130031330311312120 |
5 | 101332312441042102222 |
6 | 1000542425331440040 |
7 | 30325656644612601 |
oct | 2714341574656630 |
9 | 441161573225726 |
10 | 102010002300312 |
11 | 2a55a2209a3257 |
12 | b53627b456020 |
13 | 44bc66a9c17c2 |
14 | 1b2944bc62da8 |
15 | bbd7aa961b5c |
hex | 5cc70df35d98 |
102010002300312 has 16 divisors (see below), whose sum is σ = 255025005750840. Its totient is φ = 34003334100096.
The previous prime is 102010002300301. The next prime is 102010002300317. The reversal of 102010002300312 is 213003200010201.
It is a junction number, because it is equal to n+sod(n) for n = 102010002300291 and 102010002300300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010002300317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2125208381233 + ... + 2125208381280.
Almost surely, 2102010002300312 is an apocalyptic number.
102010002300312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102010002300312 is an abundant number, since it is smaller than the sum of its proper divisors (153015003450528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010002300312 is a wasteful number, since it uses less digits than its factorization.
102010002300312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4250416762522 (or 4250416762518 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 102010002300312 its reverse (213003200010201), we get a palindrome (315013202310513).
The spelling of 102010002300312 in words is "one hundred two trillion, ten billion, two million, three hundred thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •