Base | Representation |
---|---|
bin | 10011110100111010… |
… | …11100011110001110 |
3 | 1000110211110021220020 |
4 | 21322131130132032 |
5 | 133244441124432 |
6 | 4520124003010 |
7 | 524531351100 |
oct | 117235343616 |
9 | 30424407806 |
10 | 10644473742 |
11 | 4572589741 |
12 | 2090990466 |
13 | 1008387c96 |
14 | 72d9a5570 |
15 | 42476322c |
hex | 27a75c78e |
10644473742 has 24 divisors (see below), whose sum is σ = 24764694696. Its totient is φ = 3041278128.
The previous prime is 10644473737. The next prime is 10644473747. The reversal of 10644473742 is 24737444601.
It is an interprime number because it is at equal distance from previous prime (10644473737) and next prime (10644473747).
It is a super-2 number, since 2×106444737422 (a number of 21 digits) contains 22 as substring.
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 = 10644473694 and 10644473703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10644473747) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18102553 + ... + 18103140.
It is an arithmetic number, because the mean of its divisors is an integer number (1031862279).
Almost surely, 210644473742 is an apocalyptic number.
10644473742 is an abundant number, since it is smaller than the sum of its proper divisors (14120220954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10644473742 is a wasteful number, since it uses less digits than its factorization.
10644473742 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36205712 (or 36205705 counting only the distinct ones).
The product of its (nonzero) digits is 451584, while the sum is 42.
The spelling of 10644473742 in words is "ten billion, six hundred forty-four million, four hundred seventy-three thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •