Base | Representation |
---|---|
bin | 10010001100110100111011… |
… | …11101001011000100010000 |
3 | 12020201011202111202022012200 |
4 | 21012122131331023010100 |
5 | 20221214410230320102 |
6 | 221042214515123200 |
7 | 11300402046043341 |
oct | 1106323575130420 |
9 | 166634674668180 |
10 | 40023155323152 |
11 | 118307a7862081 |
12 | 45a49098a3500 |
13 | 194422389a701 |
14 | 9c51b987a0c8 |
15 | 4961629ad51c |
hex | 24669df4b110 |
40023155323152 has 60 divisors (see below), whose sum is σ = 112136386304124. Its totient is φ = 13325908654080.
The previous prime is 40023155323091. The next prime is 40023155323169. The reversal of 40023155323152 is 25132355132004.
40023155323152 is a `hidden beast` number, since 4 + 0 + 0 + 2 + 31 + 553 + 23 + 1 + 52 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 27541462016016 + 12481693307136 = 5247996^2 + 3532944^2 .
It is a super-3 number, since 3×400231553231523 (a number of 42 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 157613533 + ... + 157867260.
Almost surely, 240023155323152 is an apocalyptic number.
It is an amenable number.
40023155323152 is an abundant number, since it is smaller than the sum of its proper divisors (72113230980972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40023155323152 is a wasteful number, since it uses less digits than its factorization.
40023155323152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315481688 (or 315481679 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 40023155323152 in words is "forty trillion, twenty-three billion, one hundred fifty-five million, three hundred twenty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •