Base | Representation |
---|---|
bin | 111000110010101001010… |
… | …011001000010100111001 |
3 | 111211002110211101101222022 |
4 | 320302221103020110321 |
5 | 1002420132142402423 |
6 | 12144510120404225 |
7 | 551646550226666 |
oct | 70625123102471 |
9 | 14732424341868 |
10 | 3902670669113 |
11 | 1275127939827 |
12 | 530444616675 |
13 | 2240356a3198 |
14 | d6c66c78a6d |
15 | 6b7b645edc8 |
hex | 38ca94c8539 |
3902670669113 has 16 divisors (see below), whose sum is σ = 4349863984320. Its totient is φ = 3479670130176.
The previous prime is 3902670669103. The next prime is 3902670669137. The reversal of 3902670669113 is 3119660762093.
It is a cyclic number.
It is not a de Polignac number, because 3902670669113 - 220 = 3902669620537 is a prime.
It is a super-2 number, since 2×39026706691132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3902670669103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11002181 + ... + 11351357.
It is an arithmetic number, because the mean of its divisors is an integer number (271866499020).
Almost surely, 23902670669113 is an apocalyptic number.
It is an amenable number.
3902670669113 is a deficient number, since it is larger than the sum of its proper divisors (447193315207).
3902670669113 is a wasteful number, since it uses less digits than its factorization.
3902670669113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383816.
The product of its (nonzero) digits is 2204496, while the sum is 53.
The spelling of 3902670669113 in words is "three trillion, nine hundred two billion, six hundred seventy million, six hundred sixty-nine thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •