Base | Representation |
---|---|
bin | 10001101110010001110100… |
… | …11000100001101111001011 |
3 | 12002222211110010001222102001 |
4 | 20313020322120201233023 |
5 | 20102020223231031300 |
6 | 214520103512051431 |
7 | 11131512656306356 |
oct | 1067107230415713 |
9 | 162884403058361 |
10 | 38973512752075 |
11 | 11466634a02840 |
12 | 44553b2693b77 |
13 | 1899256919875 |
14 | 98a48438529d |
15 | 478bcce5716a |
hex | 23723a621bcb |
38973512752075 has 24 divisors (see below), whose sum is σ = 52720922676240. Its totient is φ = 28344163737600.
The previous prime is 38973512751991. The next prime is 38973512752081. The reversal of 38973512752075 is 57025721537983.
38973512752075 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 38973512752075 - 213 = 38973512743883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 38973512751998 and 38973512752016.
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 23 ways as a sum of consecutive naturals, for example, 43550731 + ... + 44436619.
It is an arithmetic number, because the mean of its divisors is an integer number (2196705111510).
Almost surely, 238973512752075 is an apocalyptic number.
38973512752075 is a deficient number, since it is larger than the sum of its proper divisors (13747409924165).
38973512752075 is a wasteful number, since it uses less digits than its factorization.
38973512752075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1045887 (or 1045882 counting only the distinct ones).
The product of its (nonzero) digits is 111132000, while the sum is 64.
The spelling of 38973512752075 in words is "thirty-eight trillion, nine hundred seventy-three billion, five hundred twelve million, seven hundred fifty-two thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •