Base | Representation |
---|---|
bin | 111000110011001100010… |
… | …110010101110111010000 |
3 | 111211010222210220011021222 |
4 | 320303030112111313100 |
5 | 1002422333212313202 |
6 | 12145044324304212 |
7 | 552000250433162 |
oct | 70631426256720 |
9 | 14733883804258 |
10 | 3903258713552 |
11 | 12753a9871270 |
12 | 530589542068 |
13 | 2240ca474083 |
14 | d6cc0dcc932 |
15 | 6b7ecdba4a2 |
hex | 38ccc595dd0 |
3903258713552 has 20 divisors (see below), whose sum is σ = 8250069554016. Its totient is φ = 1774208506080.
The previous prime is 3903258713531. The next prime is 3903258713567. The reversal of 3903258713552 is 2553178523093.
3903258713552 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-2 number, since 2×39032587135522 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 3903258713494 and 3903258713503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11088802988 + ... + 11088803339.
Almost surely, 23903258713552 is an apocalyptic number.
It is an amenable number.
3903258713552 is an abundant number, since it is smaller than the sum of its proper divisors (4346810840464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3903258713552 is a wasteful number, since it uses less digits than its factorization.
3903258713552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22177606346 (or 22177606340 counting only the distinct ones).
The product of its (nonzero) digits is 6804000, while the sum is 53.
The spelling of 3903258713552 in words is "three trillion, nine hundred three billion, two hundred fifty-eight million, seven hundred thirteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •