Base | Representation |
---|---|
bin | 11001110010100010010111… |
… | …001010010101010100000011 |
3 | 112212121020020211121220200020 |
4 | 121302202113022111110003 |
5 | 104331314404244433443 |
6 | 1041122140421424523 |
7 | 32614421155056444 |
oct | 3162422712252403 |
9 | 485536224556606 |
10 | 113424032421123 |
11 | 3315a953385a26 |
12 | 1087a406b6b143 |
13 | 4b39ac037aa08 |
14 | 2001a76a752cb |
15 | d1a6455e7583 |
hex | 672897295503 |
113424032421123 has 8 divisors (see below), whose sum is σ = 153146372889600. Its totient is φ = 74658856783368.
The previous prime is 113424032421107. The next prime is 113424032421199. The reversal of 113424032421123 is 321124230424311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113424032421123 - 24 = 113424032421107 is a prime.
It is a super-2 number, since 2×1134240324211232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113424032421223) 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, 239291207403 + ... + 239291207876.
It is an arithmetic number, because the mean of its divisors is an integer number (19143296611200).
Almost surely, 2113424032421123 is an apocalyptic number.
113424032421123 is a deficient number, since it is larger than the sum of its proper divisors (39722340468477).
113424032421123 is an equidigital number, since it uses as much as digits as its factorization.
113424032421123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478582415361.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 113424032421123 its reverse (321124230424311), we get a palindrome (434548262845434).
The spelling of 113424032421123 in words is "one hundred thirteen trillion, four hundred twenty-four billion, thirty-two million, four hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •