Base | Representation |
---|---|
bin | 10010010011100001100010… |
… | …11001000010101001100110 |
3 | 12021112011201001100001200112 |
4 | 21021300301121002221212 |
5 | 20234002140102134100 |
6 | 221340032055013022 |
7 | 11323126234546454 |
oct | 1111606131025146 |
9 | 167464631301615 |
10 | 40253262146150 |
11 | 1190a349098a79 |
12 | 462142806a172 |
13 | 195cb35443c41 |
14 | 9d23a82519d4 |
15 | 49c12e10cb35 |
hex | 249c31642a66 |
40253262146150 has 48 divisors (see below), whose sum is σ = 76897708573920. Its totient is φ = 15665503161600.
The previous prime is 40253262146011. The next prime is 40253262146159. The reversal of 40253262146150 is 5164126235204.
It is a super-4 number, since 4×402532621461504 (a number of 56 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 40253262146098 and 40253262146107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40253262146159) 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 23 ways as a sum of consecutive naturals, for example, 46862231 + ... + 47713469.
It is an arithmetic number, because the mean of its divisors is an integer number (1602035595290).
Almost surely, 240253262146150 is an apocalyptic number.
40253262146150 is a deficient number, since it is larger than the sum of its proper divisors (36644446427770).
40253262146150 is a wasteful number, since it uses less digits than its factorization.
40253262146150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876849 (or 876844 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 40253262146150 in words is "forty trillion, two hundred fifty-three billion, two hundred sixty-two million, one hundred forty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •