Base | Representation |
---|---|
bin | 101100100111000111001… |
… | …1000000011100100001011 |
3 | 210201010222022211101101002 |
4 | 1121032032120003210023 |
5 | 1300423404043031443 |
6 | 21012403351445215 |
7 | 1201654334421302 |
oct | 131161630034413 |
9 | 23633868741332 |
10 | 6131307002123 |
11 | 1a542aaa61626 |
12 | 83035638680b |
13 | 356244c51764 |
14 | 172a84abd439 |
15 | a97519212b8 |
hex | 5938e60390b |
6131307002123 has 4 divisors (see below), whose sum is σ = 6231820231728. Its totient is φ = 6030793772520.
The previous prime is 6131307002111. The next prime is 6131307002189. The reversal of 6131307002123 is 3212007031316.
6131307002123 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 6131307002123 - 26 = 6131307002059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6131307902123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50256614711 + ... + 50256614832.
It is an arithmetic number, because the mean of its divisors is an integer number (1557955057932).
Almost surely, 26131307002123 is an apocalyptic number.
6131307002123 is a deficient number, since it is larger than the sum of its proper divisors (100513229605).
6131307002123 is a wasteful number, since it uses less digits than its factorization.
6131307002123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100513229604.
The product of its (nonzero) digits is 4536, while the sum is 29.
The spelling of 6131307002123 in words is "six trillion, one hundred thirty-one billion, three hundred seven million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •