Base | Representation |
---|---|
bin | 10010010111100011111… |
… | …11101110110100110100 |
3 | 2020100001012111010112010 |
4 | 21023301333232310310 |
5 | 40320021030204030 |
6 | 1201533540124220 |
7 | 63411605015202 |
oct | 11136177566464 |
9 | 2210035433463 |
10 | 631125241140 |
11 | 223727821989 |
12 | a2396696670 |
13 | 476901a0164 |
14 | 22791d1c072 |
15 | 1163c6666b0 |
hex | 92f1feed34 |
631125241140 has 48 divisors (see below), whose sum is σ = 1804749633792. Its totient is φ = 164719211136.
The previous prime is 631125241139. The next prime is 631125241151. The reversal of 631125241140 is 41142521136.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 631125241098 and 631125241107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111898819 + ... + 111904458.
It is an arithmetic number, because the mean of its divisors is an integer number (37598950704).
Almost surely, 2631125241140 is an apocalyptic number.
631125241140 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
631125241140 is an abundant number, since it is smaller than the sum of its proper divisors (1173624392652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
631125241140 is a wasteful number, since it uses less digits than its factorization.
631125241140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223803336 (or 223803334 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 631125241140 its reverse (41142521136), we get a palindrome (672267762276).
The spelling of 631125241140 in words is "six hundred thirty-one billion, one hundred twenty-five million, two hundred forty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •