Base | Representation |
---|---|
bin | 11101110010010011100100… |
… | …010100100011001100111000 |
3 | 122011211111202110020222102012 |
4 | 131302103210110203030320 |
5 | 114132302140234322222 |
6 | 1142340420000225052 |
7 | 36410314243012655 |
oct | 3562234424431470 |
9 | 564744673228365 |
10 | 131000333120312 |
11 | 38816a24969367 |
12 | 128388aa60b188 |
13 | 5813380876b26 |
14 | 244c64295ac2c |
15 | 10229451b21e2 |
hex | 7724e4523338 |
131000333120312 has 8 divisors (see below), whose sum is σ = 245625624600600. Its totient is φ = 65500166560152.
The previous prime is 131000333120311. The next prime is 131000333120333. The reversal of 131000333120312 is 213021333000131.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1310003331203122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131000333120311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8187520820012 + ... + 8187520820027.
It is an arithmetic number, because the mean of its divisors is an integer number (30703203075075).
Almost surely, 2131000333120312 is an apocalyptic number.
It is an amenable number.
131000333120312 is a deficient number, since it is larger than the sum of its proper divisors (114625291480288).
131000333120312 is a wasteful number, since it uses less digits than its factorization.
131000333120312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16375041640045 (or 16375041640041 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 131000333120312 its reverse (213021333000131), we get a palindrome (344021666120443).
The spelling of 131000333120312 in words is "one hundred thirty-one trillion, three hundred thirty-three million, one hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •