Base | Representation |
---|---|
bin | 10001111001101111100… |
… | …011111100011110111101 |
3 | 11100121110000012010111001 |
4 | 101321233203330132331 |
5 | 130124003434343123 |
6 | 2341054432330301 |
7 | 154611206233126 |
oct | 21715743743675 |
9 | 4317400163431 |
10 | 1230232340413 |
11 | 4348140a199a |
12 | 17a5163a3991 |
13 | 8c019b4b42b |
14 | 4378777304d |
15 | 22003e0b0ad |
hex | 11e6f8fc7bd |
1230232340413 has 8 divisors (see below), whose sum is σ = 1257742725120. Its totient is φ = 1202777590320.
The previous prime is 1230232340411. The next prime is 1230232340419. The reversal of 1230232340413 is 3140432320321.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1230232340413 - 21 = 1230232340411 is a prime.
It is a super-2 number, since 2×12302323404132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230232340411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13863933 + ... + 13952386.
It is an arithmetic number, because the mean of its divisors is an integer number (157217840640).
Almost surely, 21230232340413 is an apocalyptic number.
It is an amenable number.
1230232340413 is a deficient number, since it is larger than the sum of its proper divisors (27510384707).
1230232340413 is an equidigital number, since it uses as much as digits as its factorization.
1230232340413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27817307.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 1230232340413 its reverse (3140432320321), we get a palindrome (4370664660734).
The spelling of 1230232340413 in words is "one trillion, two hundred thirty billion, two hundred thirty-two million, three hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •