Base | Representation |
---|---|
bin | 111000010111001101100… |
… | …011111000001010011010 |
3 | 111201021102221222012011110 |
4 | 320113031203320022122 |
5 | 1001424320323034213 |
6 | 12123155143441150 |
7 | 546554601032502 |
oct | 70271543701232 |
9 | 14637387865143 |
10 | 3873214268058 |
11 | 1263691530723 |
12 | 5267a37561b6 |
13 | 22131cb19b85 |
14 | d5670ad4a02 |
15 | 6ab404125c3 |
hex | 385cd8f829a |
3873214268058 has 16 divisors (see below), whose sum is σ = 7911246165120. Its totient is φ = 1263601817856.
The previous prime is 3873214268057. The next prime is 3873214268107. The reversal of 3873214268058 is 8508624123783.
3873214268058 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×38732142680583 (a number of 39 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3873214267989 and 3873214268007.
It is not an unprimeable number, because it can be changed into a prime (3873214268057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6867400903 + ... + 6867401466.
It is an arithmetic number, because the mean of its divisors is an integer number (494452885320).
Almost surely, 23873214268058 is an apocalyptic number.
3873214268058 is an abundant number, since it is smaller than the sum of its proper divisors (4038031897062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3873214268058 is a wasteful number, since it uses less digits than its factorization.
3873214268058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13734802421.
The product of its (nonzero) digits is 15482880, while the sum is 57.
The spelling of 3873214268058 in words is "three trillion, eight hundred seventy-three billion, two hundred fourteen million, two hundred sixty-eight thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •