Base | Representation |
---|---|
bin | 100111000010101… |
… | …0101111001001010 |
3 | 10101022001002001100 |
4 | 1032011111321022 |
5 | 10140331220432 |
6 | 333554202230 |
7 | 44315004513 |
oct | 11605257112 |
9 | 3338032040 |
10 | 1310023242 |
11 | 612523940 |
12 | 306883376 |
13 | 17b5372a8 |
14 | c5dada0a |
15 | 7a02007c |
hex | 4e155e4a |
1310023242 has 48 divisors (see below), whose sum is σ = 3105355968. Its totient is φ = 395831040.
The previous prime is 1310023237. The next prime is 1310023243. The reversal of 1310023242 is 2423200131.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1310023243) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 60523 + ... + 79265.
It is an arithmetic number, because the mean of its divisors is an integer number (64694916).
Almost surely, 21310023242 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1310023242, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1552677984).
1310023242 is an abundant number, since it is smaller than the sum of its proper divisors (1795332726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310023242 is a wasteful number, since it uses less digits than its factorization.
1310023242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19115 (or 19112 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1310023242 is about 36194.2432162906. The cubic root of 1310023242 is about 1094.1906523249.
Adding to 1310023242 its reverse (2423200131), we get a palindrome (3733223373).
The spelling of 1310023242 in words is "one billion, three hundred ten million, twenty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •