Base | Representation |
---|---|
bin | 1011001100101101100011… |
… | …0001011010011000110100 |
3 | 1121121010001001110012202012 |
4 | 2303023120301122120310 |
5 | 3103214022323232012 |
6 | 42104304203103352 |
7 | 2410404641332211 |
oct | 263133061323064 |
9 | 47533031405665 |
10 | 12313013102132 |
11 | 3a17a12995366 |
12 | 146a417211b58 |
13 | 6b415c529a12 |
14 | 307d4b0dab08 |
15 | 165452c6d622 |
hex | b32d8c5a634 |
12313013102132 has 6 divisors (see below), whose sum is σ = 21547772928738. Its totient is φ = 6156506551064.
The previous prime is 12313013102123. The next prime is 12313013102183. The reversal of 12313013102132 is 23120131031321.
It can be written as a sum of positive squares in only one way, i.e., 10090063308196 + 2222949793936 = 3176486^2 + 1490956^2 .
It is a super-2 number, since 2×123130131021322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12313013102098 and 12313013102107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1539126637763 + ... + 1539126637770.
It is an arithmetic number, because the mean of its divisors is an integer number (3591295488123).
Almost surely, 212313013102132 is an apocalyptic number.
It is an amenable number.
12313013102132 is a deficient number, since it is larger than the sum of its proper divisors (9234759826606).
12313013102132 is a wasteful number, since it uses less digits than its factorization.
12313013102132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3078253275537 (or 3078253275535 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12313013102132 its reverse (23120131031321), we get a palindrome (35433144133453).
The spelling of 12313013102132 in words is "twelve trillion, three hundred thirteen billion, thirteen million, one hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •