Base | Representation |
---|---|
bin | 11101011001011101101… |
… | …11101101010011110000 |
3 | 10120120020212021001010001 |
4 | 32230232313231103300 |
5 | 113022143014420000 |
6 | 2052011335115344 |
7 | 132656211346615 |
oct | 16545667552360 |
9 | 3516225231101 |
10 | 1010103670000 |
11 | 35a423208797 |
12 | 143921812b54 |
13 | 743385b30b9 |
14 | 36c6427450c |
15 | 1b41d7a146a |
hex | eb2eded4f0 |
1010103670000 has 50 divisors (see below), whose sum is σ = 2445562019648. Its totient is φ = 404041464000.
The previous prime is 1010103669973. The next prime is 1010103670001. The reversal of 1010103670000 is 763010101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (50).
It is a self number, because there is not a number n which added to its sum of digits gives 1010103670000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010103670001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 50495184 + ... + 50515183.
Almost surely, 21010103670000 is an apocalyptic number.
1010103670000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010103670000 is an abundant number, since it is smaller than the sum of its proper divisors (1435458349648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010103670000 is an equidigital number, since it uses as much as digits as its factorization.
1010103670000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101010395 (or 101010374 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 1010103670000 its reverse (763010101), we get a palindrome (1010866680101).
The spelling of 1010103670000 in words is "one trillion, ten billion, one hundred three million, six hundred seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •