Base | Representation |
---|---|
bin | 1001000101110010100… |
… | …11011111011111100001 |
3 | 1002212012222010020121102 |
4 | 10202321103133133201 |
5 | 20104141203240001 |
6 | 355253502204145 |
7 | 31365144532646 |
oct | 4427123373741 |
9 | 1085188106542 |
10 | 312346540001 |
11 | 11051352a571 |
12 | 50650283655 |
13 | 235b9a07792 |
14 | 11190ba9dcd |
15 | 81d1582e6b |
hex | 48b94df7e1 |
312346540001 has 4 divisors (see below), whose sum is σ = 328785831600. Its totient is φ = 295907248404.
The previous prime is 312346539971. The next prime is 312346540003. The reversal of 312346540001 is 100045643213.
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, and also an emirpimes, since its reverse is a distinct semiprime: 100045643213 = 79 ⋅1266400547.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312346540001 is a prime.
It is a super-2 number, since 2×3123465400012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (312346540003) 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, 8219645771 + ... + 8219645808.
It is an arithmetic number, because the mean of its divisors is an integer number (82196457900).
Almost surely, 2312346540001 is an apocalyptic number.
It is an amenable number.
312346540001 is a deficient number, since it is larger than the sum of its proper divisors (16439291599).
312346540001 is a wasteful number, since it uses less digits than its factorization.
312346540001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16439291598.
The product of its (nonzero) digits is 8640, while the sum is 29.
The spelling of 312346540001 in words is "three hundred twelve billion, three hundred forty-six million, five hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •