Base | Representation |
---|---|
bin | 11101110111001001100000… |
… | …001110101010100110000000 |
3 | 122020000022202020211100111010 |
4 | 131313021200032222212000 |
5 | 114203230214323344204 |
6 | 1143153334321120520 |
7 | 36443335153345002 |
oct | 3567114016524600 |
9 | 566008666740433 |
10 | 131333124434304 |
11 | 38935079994161 |
12 | 128912a5789140 |
13 | 58388781462c0 |
14 | 24607b2b0a372 |
15 | 102b42156ad89 |
hex | 7772603aa980 |
131333124434304 has 128 divisors (see below), whose sum is σ = 379135190095200. Its totient is φ = 40039456260096.
The previous prime is 131333124434269. The next prime is 131333124434321. The reversal of 131333124434304 is 403434421333131.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-3 number, since 3×1313331244343043 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 120138069 + ... + 121226324.
Almost surely, 2131333124434304 is an apocalyptic number.
It is an amenable number.
131333124434304 is an abundant number, since it is smaller than the sum of its proper divisors (247802065660896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131333124434304 is a wasteful number, since it uses less digits than its factorization.
131333124434304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241364532 (or 241364520 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 39.
Adding to 131333124434304 its reverse (403434421333131), we get a palindrome (534767545767435).
The spelling of 131333124434304 in words is "one hundred thirty-one trillion, three hundred thirty-three billion, one hundred twenty-four million, four hundred thirty-four thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •