Base | Representation |
---|---|
bin | 1110100100001011001101… |
… | …0000011111011010100010 |
3 | 2002200222121011220111221020 |
4 | 3221002303100133122202 |
5 | 4044340443223233010 |
6 | 54021005424310310 |
7 | 3242006562636531 |
oct | 351026320373242 |
9 | 62628534814836 |
10 | 16014645524130 |
11 | 5114855996520 |
12 | 19678b4472396 |
13 | 8c2236771b16 |
14 | 3d518202c318 |
15 | 1cb89ea20470 |
hex | e90b341f6a2 |
16014645524130 has 128 divisors (see below), whose sum is σ = 42576072892416. Its totient is φ = 3822628953600.
The previous prime is 16014645524099. The next prime is 16014645524131. The reversal of 16014645524130 is 3142554641061.
It is not an unprimeable number, because it can be changed into a prime (16014645524131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13574575 + ... + 14707085.
It is an arithmetic number, because the mean of its divisors is an integer number (332625569472).
Almost surely, 216014645524130 is an apocalyptic number.
16014645524130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 16014645524130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21288036446208).
16014645524130 is an abundant number, since it is smaller than the sum of its proper divisors (26561427368286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16014645524130 is a wasteful number, since it uses less digits than its factorization.
16014645524130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133192.
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 16014645524130 in words is "sixteen trillion, fourteen billion, six hundred forty-five million, five hundred twenty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •