Base | Representation |
---|---|
bin | 1000100011000011… |
… | …1101010111011010 |
3 | 12220220120111011120 |
4 | 2020300331113122 |
5 | 14144400120032 |
6 | 1015403510110 |
7 | 110601142200 |
oct | 21060752732 |
9 | 5826514146 |
10 | 2294535642 |
11 | a78229653 |
12 | 540528336 |
13 | 2a74b0bc9 |
14 | 17aa49070 |
15 | d669262c |
hex | 88c3d5da |
2294535642 has 48 divisors (see below), whose sum is σ = 5462484192. Its totient is φ = 640332000.
The previous prime is 2294535623. The next prime is 2294535671. The reversal of 2294535642 is 2465354922.
2294535642 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 2294535594 and 2294535603.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 78109 + ... + 103392.
It is an arithmetic number, because the mean of its divisors is an integer number (113801754).
Almost surely, 22294535642 is an apocalyptic number.
2294535642 is an abundant number, since it is smaller than the sum of its proper divisors (3167948550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2294535642 is a wasteful number, since it uses less digits than its factorization.
2294535642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181563 (or 181556 counting only the distinct ones).
The product of its digits is 518400, while the sum is 42.
The square root of 2294535642 is about 47901.3114851775. The cubic root of 2294535642 is about 1318.9599325516.
The spelling of 2294535642 in words is "two billion, two hundred ninety-four million, five hundred thirty-five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •