Base | Representation |
---|---|
bin | 10100011000111000000… |
… | …111001100111100100110 |
3 | 11221221111010020201110201 |
4 | 110120320013030330212 |
5 | 140423423243010010 |
6 | 2551353511341114 |
7 | 203140403610400 |
oct | 24307007147446 |
9 | 4857433221421 |
10 | 1401100750630 |
11 | 4a0226935559 |
12 | 1a766198179a |
13 | a217a98b3c9 |
14 | 4bb568a1b70 |
15 | 266a4ae323a |
hex | 146381ccf26 |
1401100750630 has 96 divisors (see below), whose sum is σ = 3091882600800. Its totient is φ = 454542907392.
The previous prime is 1401100750613. The next prime is 1401100750633. The reversal of 1401100750630 is 360570011041.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401100750633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7627222 + ... + 7808758.
It is an arithmetic number, because the mean of its divisors is an integer number (32207110425).
Almost surely, 21401100750630 is an apocalyptic number.
1401100750630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1401100750630 is an abundant number, since it is smaller than the sum of its proper divisors (1690781850170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1401100750630 is a wasteful number, since it uses less digits than its factorization.
1401100750630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182406 (or 182399 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 28.
Adding to 1401100750630 its reverse (360570011041), we get a palindrome (1761670761671).
The spelling of 1401100750630 in words is "one trillion, four hundred one billion, one hundred million, seven hundred fifty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •