Base | Representation |
---|---|
bin | 11101010010110011011… |
… | …000101010111011111000 |
3 | 21010110001012210011102000 |
4 | 131102303120222323320 |
5 | 230440213344033022 |
6 | 4140441231341000 |
7 | 265303235040456 |
oct | 35226330527370 |
9 | 7113035704360 |
10 | 2013054283512 |
11 | 706805732248 |
12 | 286187981760 |
13 | 117aa3c6109c |
14 | 6d60a5099d6 |
15 | 3756e0a36ac |
hex | 1d4b362aef8 |
2013054283512 has 128 divisors (see below), whose sum is σ = 6075998976000. Its totient is φ = 615194818560.
The previous prime is 2013054283459. The next prime is 2013054283547. The reversal of 2013054283512 is 2153824503102.
2013054283512 is a `hidden beast` number, since 2 + 0 + 1 + 30 + 542 + 83 + 5 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 7784233 + ... + 8038680.
It is an arithmetic number, because the mean of its divisors is an integer number (47468742000).
Almost surely, 22013054283512 is an apocalyptic number.
It is an amenable number.
2013054283512 is an abundant number, since it is smaller than the sum of its proper divisors (4062944692488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013054283512 is a wasteful number, since it uses less digits than its factorization.
2013054283512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15822978 (or 15822968 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
Adding to 2013054283512 its reverse (2153824503102), we get a palindrome (4166878786614).
The spelling of 2013054283512 in words is "two trillion, thirteen billion, fifty-four million, two hundred eighty-three thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •