Base | Representation |
---|---|
bin | 100011010000101111001… |
… | …001010001000011011010 |
3 | 22120122120122221202101100 |
4 | 203100233021101003122 |
5 | 304200104020410432 |
6 | 5053103023532230 |
7 | 340031656343466 |
oct | 43205711210332 |
9 | 8518518852340 |
10 | 2423152513242 |
11 | 85472047104a |
12 | 331758a5a076 |
13 | 14766b730696 |
14 | 853d18c14a6 |
15 | 430722b007c |
hex | 2342f2510da |
2423152513242 has 96 divisors (see below), whose sum is σ = 5447819954304. Its totient is φ = 777767184000.
The previous prime is 2423152513183. The next prime is 2423152513253.
2423152513242 is a `hidden beast` number, since 2 + 4 + 231 + 52 + 51 + 324 + 2 = 666.
2423152513242 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 2423152513197 and 2423152513206.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 187732953 + ... + 187745859.
It is an arithmetic number, because the mean of its divisors is an integer number (56748124524).
Almost surely, 22423152513242 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2423152513242, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2723909977152).
2423152513242 is an abundant number, since it is smaller than the sum of its proper divisors (3024667441062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2423152513242 is a wasteful number, since it uses less digits than its factorization.
2423152513242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15844 (or 15841 counting only the distinct ones).
The product of its digits is 115200, while the sum is 36.
The spelling of 2423152513242 in words is "two trillion, four hundred twenty-three billion, one hundred fifty-two million, five hundred thirteen thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •