Base | Representation |
---|---|
bin | 1110111101000011100000… |
… | …0110110100100111100100 |
3 | 2011012211212112222121121110 |
4 | 3233100320012310213210 |
5 | 4123341332441342242 |
6 | 54545215133345020 |
7 | 3314620655033043 |
oct | 357207006644744 |
9 | 64184775877543 |
10 | 16442076121572 |
11 | 526a055365762 |
12 | 1a16702038170 |
13 | 9236340561ba |
14 | 40bb2d2c055a |
15 | 1d7a696a839c |
hex | ef4381b49e4 |
16442076121572 has 48 divisors (see below), whose sum is σ = 38436734730240. Its totient is φ = 5470422895392.
The previous prime is 16442076121507. The next prime is 16442076121591. The reversal of 16442076121572 is 27512167024461.
16442076121572 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×164420761215723 (a number of 41 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194035429 + ... + 194120147.
It is an arithmetic number, because the mean of its divisors is an integer number (800765306880).
Almost surely, 216442076121572 is an apocalyptic number.
16442076121572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16442076121572 is an abundant number, since it is smaller than the sum of its proper divisors (21994658608668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16442076121572 is a wasteful number, since it uses less digits than its factorization.
16442076121572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114840 (or 114838 counting only the distinct ones).
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 16442076121572 in words is "sixteen trillion, four hundred forty-two billion, seventy-six million, one hundred twenty-one thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •