Base | Representation |
---|---|
bin | 11101011110111000001… |
… | …11101111111010000000 |
3 | 10120211202102122211120210 |
4 | 32233130013233322000 |
5 | 113044121121131222 |
6 | 2053212011034120 |
7 | 133121224521645 |
oct | 16573407577200 |
9 | 3524672584523 |
10 | 1013010333312 |
11 | 360684a1897a |
12 | 1443b313b940 |
13 | 746ac847a13 |
14 | 3705c301dcc |
15 | 1b53da59d0c |
hex | ebdc1efe80 |
1013010333312 has 64 divisors (see below), whose sum is σ = 2849091580800. Its totient is φ = 317807161344.
The previous prime is 1013010333299. The next prime is 1013010333389. The reversal of 1013010333312 is 2133330103101.
It is a tau number, because it is divible by the number of its divisors (64).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77583112 + ... + 77596167.
It is an arithmetic number, because the mean of its divisors is an integer number (44517055950).
Almost surely, 21013010333312 is an apocalyptic number.
1013010333312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1013010333312 is an abundant number, since it is smaller than the sum of its proper divisors (1836081247488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013010333312 is a wasteful number, since it uses less digits than its factorization.
1013010333312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155179313 (or 155179301 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1013010333312 its reverse (2133330103101), we get a palindrome (3146340436413).
The spelling of 1013010333312 in words is "one trillion, thirteen billion, ten million, three hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •