Base | Representation |
---|---|
bin | 10001100101101000011000… |
… | …01100001010011100000010 |
3 | 12001221102111202211001102210 |
4 | 20302310030030022130002 |
5 | 20032133214030444204 |
6 | 214131404101322550 |
7 | 11101163606234016 |
oct | 1062641414123402 |
9 | 161842452731383 |
10 | 38676385015554 |
11 | 11361621060610 |
12 | 44078ab106456 |
13 | 1877223b9a060 |
14 | 979d388b8546 |
15 | 4710dca09389 |
hex | 232d0c30a702 |
38676385015554 has 256 divisors, whose sum is σ = 97509857550336. Its totient is φ = 10057359206400.
The previous prime is 38676385015547. The next prime is 38676385015571. The reversal of 38676385015554 is 45551058367683.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 212700844 + ... + 212882600.
It is an arithmetic number, because the mean of its divisors is an integer number (380897881056).
Almost surely, 238676385015554 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 38676385015554, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48754928775168).
38676385015554 is an abundant number, since it is smaller than the sum of its proper divisors (58833472534782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38676385015554 is a wasteful number, since it uses less digits than its factorization.
38676385015554 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182113.
The product of its (nonzero) digits is 362880000, while the sum is 66.
The spelling of 38676385015554 in words is "thirty-eight trillion, six hundred seventy-six billion, three hundred eighty-five million, fifteen thousand, five hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •