Base | Representation |
---|---|
bin | 1011001100110001101101… |
… | …0110100101000001111110 |
3 | 1121121012220220100200102121 |
4 | 2303030123112211001332 |
5 | 3103223314304010220 |
6 | 42105011105113154 |
7 | 2410444424113204 |
oct | 263143326450176 |
9 | 47535826320377 |
10 | 12314130141310 |
11 | 3a18436488438 |
12 | 146a6893287ba |
13 | 6b42a9a9524a |
14 | 3080155d3074 |
15 | 1654bad6ceaa |
hex | b331b5a507e |
12314130141310 has 8 divisors (see below), whose sum is σ = 22165434254376. Its totient is φ = 4925652056520.
The previous prime is 12314130141301. The next prime is 12314130141353. The reversal of 12314130141310 is 1314103141321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×123141301413102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 615706507056 + ... + 615706507075.
It is an arithmetic number, because the mean of its divisors is an integer number (2770679281797).
Almost surely, 212314130141310 is an apocalyptic number.
12314130141310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12314130141310 is a deficient number, since it is larger than the sum of its proper divisors (9851304113066).
12314130141310 is a wasteful number, since it uses less digits than its factorization.
12314130141310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1231413014138.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 12314130141310 its reverse (1314103141321), we get a palindrome (13628233282631).
The spelling of 12314130141310 in words is "twelve trillion, three hundred fourteen billion, one hundred thirty million, one hundred forty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •