Base | Representation |
---|---|
bin | 100011100101100010110010… |
… | …1010000011100100101110001 |
3 | 1112001022201121201202000210202 |
4 | 1013023011211100130211301 |
5 | 312012033013314410001 |
6 | 3025424513322204545 |
7 | 122635115646565652 |
oct | 10713054520344561 |
9 | 1461281551660722 |
10 | 313023210310001 |
11 | 908144417a36a4 |
12 | 2b135bb3953755 |
13 | 10587c678a6379 |
14 | 5742593253529 |
15 | 262c6ba9e996b |
hex | 11cb16541c971 |
313023210310001 has 4 divisors (see below), whose sum is σ = 326632915106112. Its totient is φ = 299413505513892.
The previous prime is 313023210309989. The next prime is 313023210310003. The reversal of 313023210310001 is 100013012320313.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 313023210310001 - 226 = 313023143201137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313023210310003) 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, 6804852398021 + ... + 6804852398066.
It is an arithmetic number, because the mean of its divisors is an integer number (81658228776528).
Almost surely, 2313023210310001 is an apocalyptic number.
It is an amenable number.
313023210310001 is a deficient number, since it is larger than the sum of its proper divisors (13609704796111).
313023210310001 is a wasteful number, since it uses less digits than its factorization.
313023210310001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13609704796110.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 313023210310001 its reverse (100013012320313), we get a palindrome (413036222630314).
The spelling of 313023210310001 in words is "three hundred thirteen trillion, twenty-three billion, two hundred ten million, three hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •