Base | Representation |
---|---|
bin | 1000111101010101010111100… |
… | …0010010100110000000100001 |
3 | 10001200000102200112120110201220 |
4 | 2033111111320102212000201 |
5 | 1130111231043241413001 |
6 | 10112415523421045253 |
7 | 246531655535535561 |
oct | 21725257022460041 |
9 | 3050012615513656 |
10 | 630387253076001 |
11 | 172951807221763 |
12 | 5a8513336b6829 |
13 | 21099355764015 |
14 | b194c978ccda1 |
15 | 4cd2c4477dc36 |
hex | 23d55784a6021 |
630387253076001 has 64 divisors (see below), whose sum is σ = 924248414601216. Its totient is φ = 380955761683200.
The previous prime is 630387253075999. The next prime is 630387253076069. The reversal of 630387253076001 is 100670352783036.
It is a happy number.
It is not a de Polignac number, because 630387253076001 - 21 = 630387253075999 is a prime.
It is a super-2 number, since 2×6303872530760012 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (630387253076201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18977035 + ... + 40260431.
It is an arithmetic number, because the mean of its divisors is an integer number (14441381478144).
Almost surely, 2630387253076001 is an apocalyptic number.
630387253076001 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
It is an amenable number.
630387253076001 is a deficient number, since it is larger than the sum of its proper divisors (293861161525215).
630387253076001 is a wasteful number, since it uses less digits than its factorization.
630387253076001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21283742.
The product of its (nonzero) digits is 3810240, while the sum is 51.
The spelling of 630387253076001 in words is "six hundred thirty trillion, three hundred eighty-seven billion, two hundred fifty-three million, seventy-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •