Base | Representation |
---|---|
bin | 111010011001100001010… |
… | …000001111010000001110 |
3 | 112012122121000011202102120 |
4 | 322121201100033100032 |
5 | 1011222343030214243 |
6 | 12311335035033410 |
7 | 562640062346022 |
oct | 72314120172016 |
9 | 15178530152376 |
10 | 4013131101198 |
11 | 1307a6098031a |
12 | 54993159b866 |
13 | 23158a3b01bb |
14 | dc345274382 |
15 | 6e5cdba6c83 |
hex | 3a66140f40e |
4013131101198 has 8 divisors (see below), whose sum is σ = 8026262202408. Its totient is φ = 1337710367064.
The previous prime is 4013131101193. The next prime is 4013131101227. The reversal of 4013131101198 is 8911011313104.
It is a sphenic number, since it is the product of 3 distinct primes.
4013131101198 is an admirable number.
It is a super-2 number, since 2×40131311011982 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4013131101193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 334427591761 + ... + 334427591772.
It is an arithmetic number, because the mean of its divisors is an integer number (1003282775301).
Almost surely, 24013131101198 is an apocalyptic number.
4013131101198 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4013131101198 is a wasteful number, since it uses less digits than its factorization.
4013131101198 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 668855183538.
The product of its (nonzero) digits is 2592, while the sum is 33.
It can be divided in two parts, 401313 and 1101198, that added together give a triangular number (1502511 = T1733).
The spelling of 4013131101198 in words is "four trillion, thirteen billion, one hundred thirty-one million, one hundred one thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •