Base | Representation |
---|---|
bin | 11110001111101111010111… |
… | …000011100001110111011011 |
3 | 122102222212201101101111121222 |
4 | 132033233113003201313123 |
5 | 114413422141234313003 |
6 | 1150525535131522255 |
7 | 40006411641052502 |
oct | 3617572703416733 |
9 | 572885641344558 |
10 | 133023040151003 |
11 | 39426833297412 |
12 | 12b0490abb938b |
13 | 592c032591722 |
14 | 24bc4c7035839 |
15 | 105a37b8cdc38 |
hex | 78fbd70e1ddb |
133023040151003 has 4 divisors (see below), whose sum is σ = 133029072690408. Its totient is φ = 133017007611600.
The previous prime is 133023040150999. The next prime is 133023040151011. The reversal of 133023040151003 is 300151040320331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133023040151003 - 22 = 133023040150999 is a prime.
It is a super-2 number, since 2×1330230401510032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133023040151803) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3016236626 + ... + 3016280727.
It is an arithmetic number, because the mean of its divisors is an integer number (33257268172602).
Almost surely, 2133023040151003 is an apocalyptic number.
133023040151003 is a deficient number, since it is larger than the sum of its proper divisors (6032539405).
133023040151003 is an equidigital number, since it uses as much as digits as its factorization.
133023040151003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6032539404.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 133023040151003 its reverse (300151040320331), we get a palindrome (433174080471334).
The spelling of 133023040151003 in words is "one hundred thirty-three trillion, twenty-three billion, forty million, one hundred fifty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •