Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …00010100101101000100 |
3 | 10120202102000022101002120 |
4 | 32232211320110231010 |
5 | 113040240140220233 |
6 | 2052541422205540 |
7 | 133056534530055 |
oct | 16564570245504 |
9 | 3522360271076 |
10 | 1012100320068 |
11 | 360258277512 |
12 | 14419a4238b0 |
13 | 74596156746 |
14 | 36db34da72c |
15 | 1b4d8c014b3 |
hex | eba5e14b44 |
1012100320068 has 12 divisors (see below), whose sum is σ = 2361567413520. Its totient is φ = 337366773352.
The previous prime is 1012100319931. The next prime is 1012100320069. The reversal of 1012100320068 is 8600230012101.
1012100320068 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (1012100320069) 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, 42170846658 + ... + 42170846681.
It is an arithmetic number, because the mean of its divisors is an integer number (196797284460).
Almost surely, 21012100320068 is an apocalyptic number.
It is an amenable number.
1012100320068 is an abundant number, since it is smaller than the sum of its proper divisors (1349467093452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012100320068 is a wasteful number, since it uses less digits than its factorization.
1012100320068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84341693346 (or 84341693344 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 1012100320068 its reverse (8600230012101), we get a palindrome (9612330332169).
The spelling of 1012100320068 in words is "one trillion, twelve billion, one hundred million, three hundred twenty thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •