Base | Representation |
---|---|
bin | 10011001111100000001011… |
… | …00100000100010111001011 |
3 | 12112211012010011022010211111 |
4 | 21213300011210010113023 |
5 | 21021233244423010243 |
6 | 225554500113111151 |
7 | 11625044056150030 |
oct | 1147600544042713 |
9 | 175735104263744 |
10 | 42314111141323 |
11 | 1253434a68151a |
12 | 48b49122584b7 |
13 | 1a7c2852b12a8 |
14 | a6402a235387 |
15 | 4d5a4914239d |
hex | 267c059045cb |
42314111141323 has 4 divisors (see below), whose sum is σ = 48358984161520. Its totient is φ = 36269238121128.
The previous prime is 42314111141321. The next prime is 42314111141327. The reversal of 42314111141323 is 32314111141324.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 42314111141323 - 21 = 42314111141321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42314111141321) 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, 3022436510088 + ... + 3022436510101.
It is an arithmetic number, because the mean of its divisors is an integer number (12089746040380).
Almost surely, 242314111141323 is an apocalyptic number.
42314111141323 is a deficient number, since it is larger than the sum of its proper divisors (6044873020197).
42314111141323 is an equidigital number, since it uses as much as digits as its factorization.
42314111141323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6044873020196.
The product of its digits is 6912, while the sum is 31.
Adding to 42314111141323 its reverse (32314111141324), we get a palindrome (74628222282647).
Subtracting from 42314111141323 its reverse (32314111141324), we obtain a palindrome (9999999999999).
The spelling of 42314111141323 in words is "forty-two trillion, three hundred fourteen billion, one hundred eleven million, one hundred forty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •