Base | Representation |
---|---|
bin | 10010010000100111010001… |
… | …00000111100111000100000 |
3 | 12021011121120101200121021011 |
4 | 21020103220200330320200 |
5 | 20230332331320010404 |
6 | 221222052323510304 |
7 | 11312656045045234 |
oct | 1110235040747040 |
9 | 167147511617234 |
10 | 40153255235104 |
11 | 11880999872570 |
12 | 4605b77b28394 |
13 | 195358838492b |
14 | 9cb5dc3125c4 |
15 | 4997294aa604 |
hex | 2484e883ce20 |
40153255235104 has 24 divisors (see below), whose sum is σ = 86238241357968. Its totient is φ = 18251479652160.
The previous prime is 40153255235099. The next prime is 40153255235167.
40153255235104 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×401532552351042 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57035873562 + ... + 57035874265.
It is an arithmetic number, because the mean of its divisors is an integer number (3593260056582).
Almost surely, 240153255235104 is an apocalyptic number.
40153255235104 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
40153255235104 is an abundant number, since it is smaller than the sum of its proper divisors (46084986122864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40153255235104 is a wasteful number, since it uses less digits than its factorization.
40153255235104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114071747848 (or 114071747840 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 40.
The spelling of 40153255235104 in words is "forty trillion, one hundred fifty-three billion, two hundred fifty-five million, two hundred thirty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •