Base | Representation |
---|---|
bin | 100010111111100011001000… |
… | …001001001101110100000111 |
3 | 202011220202102020110201111112 |
4 | 202333203020021031310013 |
5 | 130133001440224244401 |
6 | 1303152545504355235 |
7 | 44262644660605244 |
oct | 4277431011156407 |
9 | 664822366421445 |
10 | 153900626009351 |
11 | 45045986223931 |
12 | 15316b80315b1b |
13 | 67b49c7759240 |
14 | 2a00b898d25cb |
15 | 12bd4961093bb |
hex | 8bf8c824dd07 |
153900626009351 has 16 divisors (see below), whose sum is σ = 167620466724480. Its totient is φ = 140449910557440.
The previous prime is 153900626009293. The next prime is 153900626009411.
153900626009351 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 153900626009351 - 246 = 83531881831687 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 153900626009351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153900626002351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2589521 + ... + 17734341.
It is an arithmetic number, because the mean of its divisors is an integer number (10476279170280).
Almost surely, 2153900626009351 is an apocalyptic number.
153900626009351 is a deficient number, since it is larger than the sum of its proper divisors (13719840715129).
153900626009351 is a wasteful number, since it uses less digits than its factorization.
153900626009351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15153706.
The product of its (nonzero) digits is 1312200, while the sum is 50.
The spelling of 153900626009351 in words is "one hundred fifty-three trillion, nine hundred billion, six hundred twenty-six million, nine thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •