Base | Representation |
---|---|
bin | 111000111101111000001… |
… | …001110111100000100001 |
3 | 111212020121100010200222212 |
4 | 320331320021313200201 |
5 | 1003114332122343413 |
6 | 12154222544411505 |
7 | 552554453654141 |
oct | 70757011674041 |
9 | 14766540120885 |
10 | 3914731059233 |
11 | 127a256698395 |
12 | 53284b616b95 |
13 | 2252081c03b7 |
14 | d768c8d6921 |
15 | 6bc7015dca8 |
hex | 38f78277821 |
3914731059233 has 2 divisors, whose sum is σ = 3914731059234. Its totient is φ = 3914731059232.
The previous prime is 3914731059223. The next prime is 3914731059287. The reversal of 3914731059233 is 3329501374193.
3914731059233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2776449047824 + 1138282011409 = 1666268^2 + 1066903^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3914731059233 is a prime.
It is a super-2 number, since 2×39147310592332 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3914731059223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1957365529616 + 1957365529617.
It is an arithmetic number, because the mean of its divisors is an integer number (1957365529617).
Almost surely, 23914731059233 is an apocalyptic number.
It is an amenable number.
3914731059233 is a deficient number, since it is larger than the sum of its proper divisors (1).
3914731059233 is an equidigital number, since it uses as much as digits as its factorization.
3914731059233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1837080, while the sum is 50.
The spelling of 3914731059233 in words is "three trillion, nine hundred fourteen billion, seven hundred thirty-one million, fifty-nine thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •